Abstract
Av ertexv is a boundary vertex of a connected graph G if there exists a vertex u such that no neighbor of v is further away from u than v. We obtain a number of properties involving different types of boundary vertices: peripheral, contour and eccentric vertices, including a realization theorem that not only corrects a wrong statement detected in [2], but also improves it. We also prove that the boundary vertex set ∂(G) of any graph G is geodetic, that is, every vertex in G lies on some shortest path joining two boundary vertices. A vertex v belongs to the contour Ct(G )o fG if no neighbor of v has an eccentricity greater than those of v. We study the geodeticity of the contour Ct(G) and other related sets.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
