Hereditary Equality of Domination and Exponential Domination
Michael A. Henning, Simon J\"ager, Dieter Rautenbach

TL;DR
This paper characterizes a broad class of graphs where the exponential domination number equals the domination number for every induced subgraph, revealing structural properties of these graphs.
Contribution
It provides a characterization of a large subclass of graphs with hereditary equality between exponential and standard domination numbers.
Findings
Identifies conditions under which exponential and domination numbers are equal for all induced subgraphs.
Characterizes a significant subclass of graphs with hereditary domination properties.
Abstract
We characterize a large subclass of the class of those graphs for which the exponential domination number of equals the domination number of for every induced subgraph of .
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
