Locally geodesic cycles in 2-self-centered graphs

DOI10.1016/0012-365X(86)90143-3MaRDI QIDQ1073807zbMATH OpenFDO

Authors Seiya Negami, Guang-Han Xu

Publication date 1986

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(86)90143-3

zbMATH Keywords

cycleeccentricityself-centered graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 568786
• scientific article; zbMATH DE number 4150230
• scientific article; zbMATH DE number 90428
• A characterization for 2-self-centered graphs
• Some notes on minimal self-centered graphs

Cites work

• scientific article; zbMATH DE number 3902706 (Why is no real title available?)
• Parallel concepts in graph theory
• The central ratio of a graph
• The dissimilarity characteristic of Husimi trees
• Unique eccentric point graphs

Cited in

(7)

• A characterization for 2-self-centered graphs
• Geodesic cycles in random graphs
• Almost self-centered graphs
• Trees with distinguishing number two
• Distance measurements related to Cartesian product of cycles
• Self-centered graphs with diameter 3
• Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs

This page was built for publication: Locally geodesic cycles in 2-self-centered graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1073807)