Abstract
We study the following problem: For which finite graphs L do there exist graphs G such that the link (i.e., the neighborhood subgraph) of each vertex of G is isomorphic to L? We give a complete solution for the cases (i) L is a disjoint union of arcs, (ii) L is a tree with only one vertex of degree greater than two, (iii) L is a circle of prescribed length. Some other cases are also discussed. An interesting case is whether the situation is changed if we require G also to be finite. It transpires (see for example, Corollaries VII.3 and VII.4) that this is indeed the case. Part I of this paper will appear in [3]. It provides the basic definitions used in both part I and part II. Section III provides the basic tool, an identification procedure, that is used throughout the rest of the paper. Section IV sets up the basic building technique for the construction of more complicated graphs. It is shown how to build graphs such that the link of each vertex is an arc (of non-constant length), and how to control the proportional number of vertices with links of various lengths.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
