| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 13430537 | Electronic Notes in Theoretical Computer Science | 2019 | 11 Pages |
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 [Hoppen, C., and N. C. Wormald. Local algorithms, regular graphs of large girth, and random regular graphs. Combinatorica 38(3) (2018), 619-664.].
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Carlos Hoppen, Giovane Mansan,