Characterization of Unique Boundary Point Graphs
DOI:
https://doi.org/10.63278/1395Keywords:
Graph, Point degree, Point distant,Boundary Point, Unique Boundary Point graphs.Abstract
For a connected graph G, the distance between two points is the length of a shortest path joining them. The eccentricity e(u) of a point u is the distance to a point farthest from u. A point v is a boundary point of a point u if d(u,w)≤d(u,v) for all wϵN(v).. A graph G is said to be unique boundary point graph if every point of G has a unique boundary point. The NazziSchnedermann style of proof is followed in characterizing the family of graphs which is a Unique Boundary point graphs or not.
Downloads
How to Cite
Issue
Section
License
Copyright (c) 2025 M. Sivanandha Saraswathy, A. Sathiya, S. Saranyasri, S. Sarulatha

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their published articles online (e.g., in institutional repositories or on their website, social networks like ResearchGate or Academia), as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).

Except where otherwise noted, the content on this site is licensed under a Creative Commons Attribution 4.0 International License.



According to the