Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.14668 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- Let $ir(G)$ and $γ(G)$ be the irredundance number and the domination number of a graph $G$, respectively. A graph $G$ is called irredundance perfect if $ir(H)=γ(H)$ for every induced subgraph $H$ of $G$. The subclass of $P_6$-free irredundance perfect graphs has been studied extensively. In this paper, we present a characterization of this graph class in terms of eleven forbidden induced subgraphs.