Geodesic-pancyclic graphs (Q2381818): Difference between revisions

A graph \(G\) is said to be geodesic-pancyclic if every path of length \(d\) between any two vertices \(u\) and \(v\) at distance \(d\) (i.e., the shortest path between \(u\) and \(v\)) can be completed to a cycle of length \(\ell\) for every \(\ell=\max\{2d,3\},\dots,n\). The authors show that several conditions known to guarantee that a graph \(G\) is panconnected, i.e., any two vertices at distance \(d\) are joined by paths of lengths \(\ell=d,\dots,n-1\), also guarantee that \(G\) is geodesic-pancyclic. E.g., they show that every graph with minimum degree \((n+2)/2\) is geodesic-pancyclic.