The hull number of a graph. (English) Zbl 0584.05044
Author’s abstract: ”A set of points S of a graph is convex if any geodesic joining two points of S lies entirely within S. The convex hull of a set T of points is the smallest convex set that contains T. The hull number (h) of a graph is the cardinality of the smallest set of points whose convex hull is the entire graph. Characterizations are given for graphs with particular values of h, and upper and lower bounds for h are derived.”
Reviewer: P.Kleinschmidt
MSC:
| 05C35 | Extremal problems in graph theory |
References:
| [1] | Harary, F., Graph Theory (1969), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0797.05064 |
| [2] | Harary, F.; Nieminen, J., Convexity in graphs, J. Diff. Geom., 16, 185-190 (1981) · Zbl 0493.05037 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
