Convex domination in the composition and cartesian product of graphs

  title={Convex domination in the composition and cartesian product of graphs},
  author={M. A. Labendia and S. Canoy},
  journal={Czechoslovak Mathematical Journal},
In this paper we characterize the convex dominating sets in the composition and Cartesian product of two connected graphs. The concepts of clique dominating set and clique domination number of a graph are defined. It is shown that the convex domination number of a composition G[H] of two non-complete connected graphs G and H is equal to the clique domination number of G. The convex domination number of the Cartesian product of two connected graphs is related to the convex domination numbers of… Expand
11 Citations
Outer-convex Domination in the Composition and Cartesian Product of Graphs
  • 2
  • Highly Influenced
Clique doubly connected domination in the join and lexicographic product of graphs
Secure convex dominating sets in products of graphs
  • 7
  • PDF
Secure convex domination in a graph
  • 23
  • PDF
Convex and isometric domination of (weak) dominating pair graphs
  • PDF


Weakly convex and convex domination numbers
  • 36
  • PDF
Convex Sets Under Some Graph Operations
  • 35
Domination in graphs : advanced topics
  • 1,288
On Domination in Graphs
  • 118
  • PDF
Fundamentals of domination in graphs
  • 3,153
  • PDF
Convex sets in graphs
  • 77
Domination in graphs
  • 144
Distance in graphs
  • 1,126