Complexity of 2-rainbow total domination problem

DOI10.1007/s40840-024-01747-8MaRDI QIDQ6607381

Aleksandra Tepeh Horvat, Tadeja Kraner Šumenjak

Publication date: 18 September 2024

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

zbMATH Keywords

NP-completedominationrainbow dominationrooted product

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rainbow domination in graphs
• Rainbow domination on trees
• A survey of selected recent results on total domination in graphs
• Bounding the \(k\)-rainbow total domination number
• Total domination in generalized prisms and a new domination invariant
• Rainbow domination in the lexicographic product of graphs
• On the 2-rainbow domination in graphs
• A new graph product and its spectrum
• Trees with equal total domination and 2-rainbow domination numbers
• On k-rainbow domination in middle graphs
• Structures of Domination in Graphs
• Topics in Domination in Graphs
• Domination-related parameters in rooted product graphs

This page was built for publication: Complexity of 2-rainbow total domination problem