On \(k\)-rainbow independent domination in graphs

DOI10.1016/j.amc.2018.03.113zbMath1427.05162arXiv1709.08966OpenAlexW2963187482MaRDI QIDQ2335156

Douglas F. Rall, Tadeja Kraner Šumenjak, Aleksandra Tepeh Horvat

Publication date: 13 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.08966

zbMATH Keywords

dominationNordhaus-Gaddum\(k\)-rainbow independent domination

Mathematics Subject Classification ID

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

Related Items (6)

On the 2-rainbow independent domination numbers of some graphs ⋮ Unnamed Item ⋮ Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs ⋮ Total domination in generalized prisms and a new domination invariant ⋮ Rainbow Domination in Graphs ⋮ On 2-rainbow domination number of functigraph and its complement

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rainbow domination in graphs
• Note on 2-rainbow domination and Roman domination in graphs
• On the well-coveredness of Cartesian products of graphs
• Further results regarding the sum of domination number and average eccentricity
• Relating domination, exponential domination, and porous exponential domination
• A survey of Nordhaus-Gaddum type relations
• Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars
• On the strong Roman domination number of graphs
• On the 2-rainbow domination in graphs
• On Complementary Graphs
• On dominating the Cartesian product of a graph and K₂

This page was built for publication: On \(k\)-rainbow independent domination in graphs