## Strict boundary vertices of a graph

Publication Type : Journal Article

Publisher : Advances and applications in discrete mathematics

Source : Advances and applications in discrete mathematics, pushpa publishing house, Volume 12, Issue 1, Number 1, p.61–72 (2013)

Campus : Bengaluru

School : School of Engineering

Department : Mathematics

Verified : Yes

Year : 2013

Abstract : Let G be a simple connected graph. A vertex v of G is said to be a boundary vertex of another vertex u of G if d(w, u) ≤ d(u, v) for each neighbor w of v. If a vertex v is a boundary vertex of any vertex u of G, then it is said to be a boundary vertex of the graph G. In this paper, we define a vertex v of G to be a strict boundary vertex ofanother vertex u of G if d(w, u) d(u, v) for each neighbor w of v. If a vertex v is a strict boundary vertex of any vertex u of G, then it is said to be a strict boundary vertex of the graph G. In this paper, we study the properties of strict boundary vertices of a graph.

Cite this Research Publication : Dr. K. N. Meera and Sooryanarayana, B., “Strict boundary vertices of a graph”, Advances and applications in discrete mathematics, vol. 12, no. 1, pp. 61–72, 2013.