Characterization of Unique Boundary Point Graphs

Authors

  • M. Sivanandha Saraswathy Associate Professorof Mathematics, Velammal College of Engineering and Technology, India
  • A. Sathiya Assistant Professor of Mathematics, School of Science and Technology, Dhanalakshmi Srinivasan University, India
  • S. Saranyasri Assistant Professor of Mathematics, K. Ramakrishnan College of Technology, India
  • S. Sarulatha Associate Professor of Mathematics, J.J.College of Engineering and Technology, India

DOI:

https://doi.org/10.63278/1395

Keywords:

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

M. Sivanandha Saraswathy, A. Sathiya, S. Saranyasri, and S. Sarulatha. 2025. “Characterization of Unique Boundary Point Graphs”. Metallurgical and Materials Engineering 31 (4):44-47. https://doi.org/10.63278/1395.

Issue

Section

Research