Generalised irredundance in graphs: Nordhaus-Gaddum bounds
From MaRDI portal
Publication:4823302
DOI10.7151/dmgt.1221zbMath1055.05111OpenAlexW2081711724MaRDI QIDQ4823302
Stephen Finbow, E. J. Cockayne
Publication date: 27 October 2004
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5bee66097d3cbf8a8fc89d820c9dffaa5b7de6e0
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
Enumeration and maximum number of maximal irredundant sets for chordal graphs ⋮ The Private Neighbor Concept
This page was built for publication: Generalised irredundance in graphs: Nordhaus-Gaddum bounds