Stable and unstable graphs with total irredundance number zero

Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


For a graph G = (V, E), a set S ⊆ V is total irredundant if for every vertex v ∈ V, the set N[v] - N[S - {v}] is not empty. The total irredundance number irt(G) is the minimum cardinality of a maximal total irredundant set of G. We study the structure of the class of graphs which do not have any total irredundant sets; these are called irt(0)-graphs. Particular attention is given to the subclass of irt(0)-graphs whose total irredundance number either does not change (stable) or always changes (unstable) under arbitrary single edge additions. Also studied are irt(0)-graphs which are either stable or unstable under arbitrary single edge deletions.

Original languageEnglish
Pages (from-to)33-46
Number of pages14
JournalArs Combinatoria
Publication statusPublished - 2001
Externally publishedYes

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'Stable and unstable graphs with total irredundance number zero'. Together they form a unique fingerprint.

Cite this