Irredundance and Maximum Degree in Graphs

DOI10.1017/S0963548396002891zbMath0881.05068OpenAlexW2052574623MaRDI QIDQ4348784

E. J. Cockayne, Christina M. Mynhardt

Publication date: 7 August 1997

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548396002891

zbMATH Keywords

dominationirredundance numbermaximal irredundant sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (11)

Irredundance, secure domination and maximum degree in trees ⋮ Irredundance in grids ⋮ Domination chain: characterisation, classical complexity, parameterised complexity and approximability ⋮ Partial domination and irredundance numbers in graphs ⋮ Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack ⋮ A lower bound for the CO-irredundance number of a graph ⋮ Enumeration and maximum number of maximal irredundant sets for chordal graphs ⋮ On the Complexity Landscape of the Domination Chain ⋮ The total irredundance numbers on graphs ⋮ Open irredundance and maximum degree in graphs ⋮ Irredundance

This page was built for publication: Irredundance and Maximum Degree in Graphs