Asymptotic bounds on total domination in regular graphs
Combinatorics
2020-01-07 v2
Abstract
We find new upper bounds on the size of a minimum totally dominating set for random regular graphs and for regular graphs with large girth. These bounds are obtained through the analysis of a local algorithm using a method due to Hoppen and Wormald [Local algorithms, regular graphs of large girth, and random regular graphs. Combinatorica 38(3) (2018), 619-664].
Cite
@article{arxiv.1812.03560,
title = {Asymptotic bounds on total domination in regular graphs},
author = {Carlos Hoppen and Giovane Mansan},
journal= {arXiv preprint arXiv:1812.03560},
year = {2020}
}