On the geodetic and the hull numbers in strong product graphs

A set S of vertices of a connected graph G is convex, if for any pair of vertices u,v@?S, every shortest path joining u and v is contained in S. The convex hull CH(S) of a set of vertices S is defined as the smallest convex set in G containing S. The set S is geodetic, if every vertex of G lies on some shortest path joining two vertices in S, and it is said to be a hull set if its convex hull is V(G). The geodetic and the hull numbers of G are the minimum cardinality of a geodetic and a minimum hull set, respectively. In this work, we investigate the behavior of both geodetic and hull sets with respect to the strong product operation for graphs. We also establish some bounds for the geodetic number and the hull number and obtain the exact value of these parameters for a number of strong product graphs.

[1]  R. S. Hales,et al.  Numerical invariants and the strong product of graphs , 1973 .

[2]  Pelayo Melero,et al.  Generalizing the krein-milman property in graph convexity spaces: a short survey , 2006 .

[3]  José Cáceres,et al.  On geodetic sets formed by boundary vertices , 2006, Discret. Math..

[4]  Jayme Luiz Szwarcfiter,et al.  On the computation of the hull number of a graph , 2009, Discret. Math..

[5]  Sergio R. Canoy,et al.  On the Hull Number of the Composition of Graphs , 2005, Ars Comb..

[6]  Dan Pritikin,et al.  Geodesic Convexity and Cartesian Products in Graphs , 2002 .

[7]  Byung Kee Kim,et al.  THE GEODETIC NUMBER OF A GRAPH , 2004 .

[8]  Bostjan Bresar,et al.  Edge-connectivity of strong products of graphs , 2007, Discuss. Math. Graph Theory.

[9]  Maria Kwasnik.  The primitivity of the strong product of two directed graphs , 1993, Discret. Math..

[10]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[11]  M. Farber,et al.  Convexity in graphs and hypergraphs , 1986 .

[12]  Aleksander Vesel.  The independence number of the strong product of cycles , 1998 .

[13]  Ladislav Stacho,et al.  Hamiltonian threshold for strong products of graphs , 2008, J. Graph Theory.

[14]  Martin G. Everett,et al.  The hull number of a graph , 1985, Discret. Math..

[15]  Gary Chartrand,et al.  Extreme Geodesic Graphs , 2002 .

[16]  W. Imrich,et al.  Product Graphs: Structure and Recognition , 2000 .

[17]  Janez Zerovnik.  Chromatic numbers of the strong product of odd cycles , 2002, Electron. Notes Discret. Math..

[18]  José Cáceres,et al.  Geodeticity of the contour of chordal graphs , 2008, Discret. Appl. Math..

[19]  Sergio R. Canoy,et al.  On the hull sets and hull number of the cartesian product of graphs , 2004, Discret. Math..

[20]  Jayme Luiz Szwarcfiter,et al.  Some remarks on the geodetic number of a graph , 2010, Discret. Math..

[21]  Aleksandra Tepeh,et al.  On the geodetic number and related metric sets in Cartesian product graphs , 2008, Discret. Math..

[22]  Robert Sámal,et al.  Pancyclicity of Strong Products of Graphs , 2004, Graphs Comb..

[23]  Ortrud R. Oellermann,et al.  Rebuilding convex sets in graphs , 2005, Discret. Math..

[24]  Toru Kojima.  Bandwidth of the strong product of two connected graphs , 2008, Discret. Math..