A note on double domination in graphs
Abel Cabrera Martinez, Juan A. Rodriguez-Velazquez

TL;DR
This paper improves existing results on double domination in graphs, a topic within the broader study of multiple domination, by building upon recent research and techniques discussed in a comprehensive book on graph domination.
Contribution
It provides enhancements to known results on double domination, refining the understanding of this specific graph domination parameter.
Findings
Improved bounds or results on double domination in graphs.
Enhanced techniques for analyzing double domination.
Refined theoretical understanding of double domination properties.
Abstract
Recently, Haynes, Hedetniemi and Henning published the book Topics in Domination in Graphs, which comprises 16 contributions that present advanced topics in graph domination, featuring open problems, modern techniques, and recent results. One of these contributions is the chapter Multiple Domination, by Hansberg and Volkmann, where they put into context all relevant research results on multiple domination that have been found up to 2020. In this note, we show how to improve some results on double domination that are included in the book.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Cooperative Communication and Network Coding
