Let P be a graph property. A graph G is said to be locally P if the subgraph induced by the open neighbourhood of every vertex in G has property P. Ryjáček's well-known conjecture that every connected, locally connected graph is weakly pancyclic motivated us to consider the global cycle structure of locally P graphs, where P is the property of having diameter at most k for some fixed k ≥ 1. For k = 2 these graphs are called locally isometric graphs. For ∆ ≤ 5, we obtain a complete structural characterization of locally isometric graphs that are not fully cycle extendable. For ∆ = 6, it is shown that locally isometric graphs that are not fully cycle extendable contain a pair of true twins of degree 6. Infinite classes of locally isometric graphs with ∆ = 6 that are not fully cycle extendable are described and observations are made that suggest that a complete characterization of these graphs is unlikely. It is shown that Ryjáček's conjecture holds for all locally isometric graphs with ∆ ≤ 6. The Hamilton cycle problem for locally isometric graphs with maximum degree at most 8 is shown to be NP-complete.
Let P be a graph property. A graph G is said to be locally P (closed locally P) if the subgraph induced by the open neighbourhood (closed neighbourhood, respectively) of every vertex in G has property P. The clustering coefficient of a vertex is the proportion of pairs of its neighbours that are themselves neighbours. The minimum clustering coefficient of G is the smallest clustering coefficient among all vertices of G. Let H be a subgraph of a graph G and let S ⊆ V (H). We say that H is a strongly induced subgraph of G with attachment set S, if H is an induced subgraph of G and the vertices of V (H) − S are not incident with edges that are not in H. A graph G is fully cycle extendable if every vertex of G lies in a triangle and for every nonhamiltonian cycle C of G, there is a cycle of length |V (C)| + 1 that contains the vertices of C. A complete characterization, of those locally connected graphs with minimum clustering coefficient 1/2 and maximum degree at most 6 that are fully cycle extendable, is given in terms of forbidden strongly induced subgraphs (with specified attachment sets). Moreover, it is shown that all locally connected graphs with ∆ ≤ 6 and sufficiently large minimum clustering coefficient are weakly pancylic, thereby proving Ryjáček's conjecture for this class of graphs.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.