Paired-domination of Cartesian products of graphs and rainbow domination

DOI10.1016/j.endm.2005.06.059zbMath1200.05154MaRDI QIDQ3439340

Michael A. Henning, Boštjan Brešar, Douglas F. Rall

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.059

zbMATH Keywords

Vizing's conjecture; graph products; paired-domination; 3-packing

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

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

05C76: Graph operations (line graphs, products, etc.)

Related Items

On rainbow domination numbers of graphs, 2-rainbow domination in generalized petersen graphs \(P(n,3)\), Rainbow domination on trees, A polynomial-time algorithm for the paired-domination problem on permutation graphs, 2-rainbow domination of generalized Petersen graphs \(P(n,2)\), On total domination in the Cartesian product of graphs, A Vizing-type result for semi-total domination, Rainbow domination numbers of generalized Petersen graphs, The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs, Independent rainbow domination of graphs, Total and paired domination numbers of toroidal meshes, Rainbow domination and related problems on strongly chordal graphs, A tight upper bound for 2-rainbow domination in generalized Petersen graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relations between packing and covering numbers of a tree
• An inequality related to Vizing's conjecture
• On the domination of the products of graphs II: Trees