On the hull sets and hull number of the cartesian product of graphs

@article{Cagaanan2004OnTH,
  title={On the hull sets and hull number of the cartesian product of graphs},
  author={Gilbert B. Cagaanan and S. Canoy},
  journal={Discret. Math.},
  year={2004},
  volume={287},
  pages={141-144}
}
For a connected graph G, the convex hull of a subset C of V(G) is defined as the smallest convex set in G containing C. A subset C of V(G) is a hull set in G if the convex hull of C is V(G). The cardinality of a minimum hull set in G is called the hull number of G. Chartrand, Harary and Zhang (2000) presented the hull number of the Cartesian product of a nontrivial connected graph and K2. In this paper, we give the hull number of the Cartesian product of any two connected graphs. 
26 Citations
Geodetic and hull numbers of strong products of graphs
  • 1
  • PDF
Weakly hull number of a graph
  • PDF
On the P3-hull number of some products of graphs
  • 3
On the geodetic and the hull numbers in strong product graphs
  • 33
  • PDF
Hull number: P5-free graphs and reduction rules
  • 11
Hull number: P5-free graphs and reduction rules
  • 10
On the hull number of some graph classes
  • 31
  • PDF
On the geodetic number and related metric sets in Cartesian product graphs
  • 45
  • PDF
On the hull number of some graph classes
  • 11
...
1
2
3
...

References

SHOWING 1-4 OF 4 REFERENCES
The hull number of a graph
  • 93
Distance in graphs
  • 1,131
  • Highly Influential
On the Hull Number of the Composition of Graphs
  • 15
Graph theory
  • 13,779
  • PDF