… sufficient conditions for graphs to be geodesic-pancyclic analogous to those for graphs to be
… sufficient conditions for panconnected graphs can be applied to geodesic-pancyclic graphs. …

… The geodesic-pancyclic property is an enhancement of the edge… and failed to find a
geodesic-pancyclic graph that is not … This section is dedicated to illustrating the geodesic pancyclic …

… the geodesic pancyclic property of Augmented cubes. Next, geodesic cycle and geodesic
pancyclic … Since AQ2 is the complete graph K4,AQ2 is geodesic pancyclic. Since AQ3 is vertex-…

… graphs can be applied to geodesic-pancyclic graphs. Note that if a graph G is weakly
geodesic-pancyclic or … geodesic-pancyclic graphs and panconnected graphs are not identical. A …

… A graph is weakly geodesic pancyclic (respectively, balanced … is the Cartesian product of
complete graphs with b vertices. The … - b hypercube is weakly geodesic pancyclic for b ≥ 3 and …

… In this paper, a network is represented as a loopless undirected graph. For the … 3 CQn is
4-geodesic pancyclic This section is dedicated to illustrating the geodesic pancyclic property of …

… graph G, au − v geodesic is au − v path of length d(u, v) in G or a shortest u − v path in G. A
graph G of order n is defined in [2] to be geodesic-pancyclic if … , a geodesic-pancyclic graph is …

… A graph G is geodesic pancyclic if for any pair of its vertices u, v, there is an l-cycle containing
a (u, v)-geodesic path for every integer l satisfying max{2d(u, v),3} ≤ l ≤ |V (G)|. Geodesic …

… is geodesic-pancyclic [Citation8]. In this paper, a network is usually represented by a simple
undirected graph… For other standard graph notations not defined here, refer to [Citation1]. Let …

… A graph G is geodesic pancyclic if for any two vertices x, y ∈ V (G), there exists a (x, y)-geodesic
cycle of every length from max{2d(x, y), 3} to |V (G)|. A graph G is balanced k-pancyclic if …