Total domination in regular graphs

DOI10.1016/j.entcs.2019.08.046OpenAlexW2978867094WikidataQ113317385 ScholiaQ113317385MaRDI QIDQ2132388

Giovane Mansan, Carlos Hoppen

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.046

zbMATH Keywords

random regular graphstotal dominationlarge girth

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Related Items

Asymptotic bounds on total domination in regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properties of regular graphs with large girth via local algorithms
• Total domination of graphs and small transversals of hypergraphs
• Total domination in graphs with given girth
• The asymptotic distribution of short cycles in random regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• Local algorithms, regular graphs of large girth, and random regular graphs
• Local algorithms for independent sets are half-optimal
• Transversals in 5-uniform hypergraphs and total domination in graphs with minimum degree five
• Graph Theory and Probability
• Total domination in graphs
• Some remarks on domination
• Graphs with large total domination number
• Total Domination in Graphs
• On large‐girth regular graphs and random processes on trees
• Reducibility among Combinatorial Problems
• On the Independent Domination Number of Random Regular Graphs
• Randomized greedy algorithms for finding smallk-dominating sets of regular graphs
• Limits of local algorithms over sparse random graphs