Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\)

DOI10.1007/s40840-022-01269-1zbMath1497.05211arXiv2111.00125OpenAlexW4220844036MaRDI QIDQ2147590

Doost Ali Mojdeh, Nasrin Soltankhah, Babak Samadi

Publication date: 20 June 2022

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

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

zbMATH Keywords

treeNP-completedouble domination number\(k\)-tuple domatic partitiondouble Slater numberfull graphs

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

• Improved bounds on the domination number of a tree
• Some comments on the Slater number
• \(k\)-tuple domination in graphs
• Dominating sets in perfect graphs
• A new lower bound on the double domination number of a graph
• The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination
• A note on the double domination number in trees
• Towards a theory of domination in graphs
• Smallest domination number and largest independence number of graphs and forests with given degree sequence
• Topics in Domination in Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\)