Exact double domination in subdivision, Mycielskian and middle graphs
Ali Behtoei, Rozhin Zarifian
TL;DR
This paper investigates the existence of exact doubly dominating sets in well-known graph structures and their complements, providing precise conditions and results for these classes.
Contribution
It offers new results on the existence of exact doubly dominating sets in subdivision, Mycielskian, and middle graphs, including their complements.
Findings
Exact doubly dominating sets characterized for these graph classes
Results applicable to arbitrary graphs and their complements
Enhanced understanding of domination properties in complex graphs
Abstract
WE determine the existence of exact (efficient) doubly dominating sets in three famous structures and in their complement for arbitrary 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