Answers are grounded in this paper and cite their sources.
Let and denote the irredundance number and the domination number of a graph , respectively. A graph is said to be irredundance perfect if for every induced subgraph of . The class of ‐free irredundance perfect graphs has been studied extensively in the literature. In this paper, we provide a characterization of this class in terms of eleven forbidden induced subgraphs.
No takes yet. Share an insight, caveat, or question.
Zverovich et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: