# Strict boundary vertices of a graph

## Amrita on Social Media

## Contact us

Amrita University,

Amrita Vishwa Vidyapeetham

Amritanagar, Coimbatore - 641 112

Tamilnadu, India

Amrita Vishwa Vidyapeetham

Amritanagar, Coimbatore - 641 112

Tamilnadu, India

## Publication Type:

Journal Article## Authors:

K. N. Meera; B. Sooryanarayana## Source:

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

http://search.proquest.com/openview/8fbe64692d9c1d89e2ba1f5828846b95/1.pdf?pq-origsite=gscholar&cbl=1816359## 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 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 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

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.## Related Research Publications