Title of article :
Some structural, metric and convex properties on the boundary of a graph
Author/Authors :
Hernando، نويسنده , , Carmen and Mora، نويسنده , , Mercè and Pelayo، نويسنده , , Ignacio M. and Seara، نويسنده , , Carlos، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2006
Pages :
7
From page :
203
To page :
209
Abstract :
Let u , v ∈ V be two vertices of a connected graph G. The vertex v is said to be a boundary vertex of u if no neighbor of v is further away from u than v. The boundary of a graph is the set of all its boundary vertices. In this work, we present a number of properties of the boundary of a graph under different points of view: (1) a realization theorem involving different types of boundary vertex sets: extreme set, periphery, contour, and the whole boundary; (2) the boundary is an edge-geodetic set, and the contour is a monophonic set; (3) the boundary is a resolving set.
Keywords :
Contour , boundary , Extreme set , Graph convexity , metric dimension
Journal title :
Electronic Notes in Discrete Mathematics
Serial Year :
2006
Journal title :
Electronic Notes in Discrete Mathematics
Record number :
1454298
Link To Document :
بازگشت