Domination cover number of graphs

DOI10.1142/S1793830919500204zbMath1410.05158arXiv1805.02345OpenAlexW2800629491MaRDI QIDQ4634292

Mohsen Alambardar Meybodi, Mohammad Reza Hooshmandasl, Pouyeh Sharifani, Ali Shakiba

Publication date: 7 May 2019

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

dominating setstotal dominating setsdomination cover number

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal dominating sets in interval graphs and trees
• Minimal dominating sets in graph classes: combinatorial bounds and enumeration
• On the number of minimal dominating sets on some graph classes
• A linear algorithm for the domination number of a tree
• Trees having many minimal dominating sets
• \([1,2\)-sets in graphs]
• Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
• Total domination in graphs
• Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
• Combinatorial bounds via measure and conquer