Convex domination in the composition and cartesian product of graphs

DOI10.1007/s10587-012-0060-3zbMath1274.05356OpenAlexW1967490291MaRDI QIDQ4909746

Sergio R. jun. Canoy, Mhelmar A. Labendia

Publication date: 21 March 2013

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10338.dmlcz/143041

zbMATH Keywords

compositionCartesian productconvex domination numberclique dominating setconvex dominating set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

The convex and weak convex domination number of convex polytopes ⋮ Convex and isometric domination of (weak) dominating pair graphs ⋮ Convex dominating sets in maximal outerplanar graphs ⋮ Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs ⋮ Clique doubly connected domination in the join and lexicographic product of graphs

Cites Work

• Convex sets under some graph operations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Convex domination in the composition and cartesian product of graphs