Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Some structural, metric and convex properties of the boundary of a graph

Autor
Hernando, M.; Mora, M.; Pelayo, I. M.; Seara, C.
Tipus d'activitat
Article en revista
Revista
Ars combinatoria
Data de publicació
2013-04-25
Volum
109
Pàgina inicial
267
Pàgina final
283
Repositori
http://hdl.handle.net/2117/20898 Obrir en finestra nova
URL
http://www.combinatorialmath.ca/arscombinatoria/vol109.html Obrir en finestra nova
Resum
Let u;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 diÆerent points of view: (1) a realization theorem involving diÆerent types of boundary vertex sets: extreme set, periphery, contour, and the whole boundary; (2) the contour is a monophonic set; and (3...
Citació
Hernando, M. [et al.]. Some structural, metric and convex properties of the boundary of a graph. "Ars combinatoria", 25 Abril 2013, vol. 109, p. 267-283.
Paraules clau
Boundary, Contour, Extreme set, Graph convexity, Metric dimension.
Grup de recerca
CGA -Computational Geometry and Applications
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
DCG - Discrete and Combinatorial Geometry

Arxius