On rainbow domination numbers of graphs

DOI10.1016/j.ins.2013.07.020zbMath1321.05190OpenAlexW1983482338MaRDI QIDQ497921

Xiaodong Xu, Chuang Yin, Zehui Shao, Janez Žerovnik, Meilian Liang, Polona Pavlič

Publication date: 25 September 2015

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2013.07.020

zbMATH Keywords

generalized Petersen graphdomination numberrainbow domination number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (17)

The independent domination numbers of strong product of two cycles ⋮ On the outer independent 2-rainbow domination number of Cartesian products of paths and cycles ⋮ Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \(\{2\}\)-domination number ⋮ Upper bound on 3-rainbow domination in graphs with minimum degree 2 ⋮ Note on two generalizations of the Randić index ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ Rainbow domination numbers of generalized Petersen graphs ⋮ Independent rainbow domination of graphs ⋮ On the 2-rainbow domination stable graphs ⋮ Weak \(\{2\}\)-domination number of Cartesian products of cycles ⋮ On 2-rainbow domination of generalized Petersen graphs ⋮ Graph distance measures based on topological indices revisited ⋮ Bounding the \(k\)-rainbow total domination number ⋮ Rainbow Domination in Graphs ⋮ Total $k$-Rainbow domination numbers in graphs ⋮ On \(k\)-rainbow domination in regular graphs ⋮ 2-rainbow domination stability of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Roman domination number of the Cartesian products of paths and cycles
• On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs
• Efficient algorithms for the minimum connected domination on trapezoid graphs
• Rainbow domination in graphs
• 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
• Rainbow domination on trees
• Dominating sets in directed graphs
• 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
• Vertex domination of generalized Petersen graphs
• Dominating sets in social network graphs
• The bottleneck independent domination on the classes of bipartite graphs and block graphs.
• On the 2-rainbow domination in graphs
• On the domination number of the generalized Petersen graphs
• Paired-domination of Cartesian products of graphs and rainbow domination
• On dominating the Cartesian product of a graph and K₂
• A theorem on tait colorings with an application to the generalized Petersen graphs

This page was built for publication: On rainbow domination numbers of graphs