On the hull number of a graph. (Q2715978)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the hull number of a graph. |
scientific article; zbMATH DE number 1600949
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the hull number of a graph. |
scientific article; zbMATH DE number 1600949 |
Statements
20 July 2005
0 references
geodetic number
0 references
geodesic
0 references
convex hull
0 references
cartesian product
0 references
On the hull number of a graph. (English)
0 references
Denote by \(H(S)\) the set of all vertices lying on a geodesic between some pair of vertices from \(S\). A set \(S\) is convex if \(S=H(S)\). The hull number \(h(G)\) of a graph \(G\) is the minimum cardinality among the subsets \(S\) of \(V(G)\) with the property that the convex hull of \(S\) equals \(V(G)\). The hull number and its relationship to the geodetic number are investigated.
0 references
