Rebuilding convex sets in graphs
|Author||Cáceres González, José
Márquez Pérez, Alberto
Oellermann, Ortrud R.
Puertas González, María Luz
|Department||Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)|
|Published in||Discrete Mathematics, 297 (1-3), 26-37.|
|Abstract||The usual distance between pairs of vertices in a graph naturally gives rise to the notion of an interval between a pair of vertices in a graph. This in turn allows us to extend the notions of convex sets, convex hull, and ...
The usual distance between pairs of vertices in a graph naturally gives rise to the notion of an interval between a pair of vertices in a graph. This in turn allows us to extend the notions of convex sets, convex hull, and extreme points in Euclidean space to the vertex set of a graph. The extreme vertices of a graph are known to be precisely the simplicial vertices, i.e., the vertices whose neighborhoods are complete graphs. It is known that the class of graphs with the Minkowski–Krein–Milman property, i.e., the property that every convex set is the convex hull of its extreme points, is precisely the class of chordal graphs without induced 3-fans. We define a vertex to be a contour vertex if the eccentricity of every neighbor is at most as large as that of the vertex. In this paper we show that every convex set of vertices in a graph is the convex hull of the collection of its contour vertices. We characterize those graphs for which every convex set has the property that its contour vertices coincide with its extreme points. A set of vertices in a graph is a geodetic set if the union of the intervals between pairs of vertices in the set, taken over all pairs in the set, is the entire vertex set. We show that the contour vertices in distance hereditary graphs form a geodetic set.