\input zb-basic
\input zb-ioport
\iteman{io-port 05948774}
\itemau{Santhakumaran, A.P.; Ullas Chandran, S.V.}
\itemti{The hull number of strong product graphs.}
\itemso{Discuss. Math., Graph Theory 31, No. 3, 493-507 (2011).}
\itemab
Summary: For a connected graph $G$ with at least two vertices and $S$ a subset of vertices, the convex hull $[S]_G$ is the smallest convex set containing $S$. The hull number $h(G)$ is the minimum cardinality among the subsets $S$ of $V(G)$ with $[S]_G= V(G)$. Upper bound for the hull number of strong product $G\boxtimes H$ of two graphs $G$ and $H$ is obtainted. Improved upper bounds are obtained for some class of strong product graphs. Exact values for the hull number of some special classes of strong product graphs are obtained. Graphs $G$ and $H$ for which $h(G\boxtimes H)= h(G)h(H)$ are characterized.
\itemrv{~}
\itemcc{}
\itemut{strong product; geodetic number; hull number; extreme hull graph}
\itemli{doi:10.7151/dmgt.1560}
\end