Locally geodesic cycles in 2-self-centered graphs (Q1073807): Difference between revisions

An r-self-centered graph is one in which each vertex has eccentricity r. A cycle C in a graph G is said to be locally geodesic at vertex v of C if for each vertex u in C the distance between u and v in C coincides with that in G. The authors show that each vertex v of a 2-self-centered graph lies in a cycle locally geodesic at v which has length 4 or 5 and that if for each vertex v of a block G the maximum length of cycles locally geodesic at v is 4, then G is 2-self centered.