Convex domination in the composition and Cartesian product of graphs.

DOI10.1007/S10587-012-0060-3zbMATH Open1274.05356OpenAlexW1967490291MaRDI QIDQ4909746FDOQ4909746

Authors: Mhelmar A. Labendia, S. R. Canoy 

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

Recommendations

• Weakly convex and convex domination numbers of some products of graphs.
• Graphs with convex domination number close to their order
• On dominating the Cartesian product of a graph and K₂
• Some results on domination number of products of graphs
• Outer-convex domination in graphs

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Convex sets under some graph operations
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• Weakly convex and convex domination numbers of some products of 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
• Convex and isometric domination of (weak) dominating pair graphs
• The convex and weak convex domination number of convex polytopes
• On cliques and forcing \(m\)-convexity numbers of graphs.
• Convex dominating sets in maximal outerplanar graphs
• Characterization of the Cartesian product of complete graphs by convex subgraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909746)