Efficient domination in regular graphs
Misa Nakanishi
TL;DR
This paper investigates the properties and characteristics of efficient domination specifically within regular graphs, aiming to deepen understanding of their structure and potential applications.
Contribution
It introduces new insights or methods for analyzing efficient domination in regular graphs, advancing theoretical understanding in this area.
Findings
Characterization of efficient dominating sets in regular graphs
Identification of conditions for existence of efficient domination
Potential algorithms for finding efficient dominating sets
Abstract
In this paper, we study efficient domination in regular graphs.
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