Nordhaus-Gaddum results for CO-irredundance in graphs

DOI10.1016/S0012-365X(99)00282-4zbMath0948.05037OpenAlexW2013162935MaRDI QIDQ1969790

E. J. Cockayne, Christina M. Mynhardt, Devon McCrea

Publication date: 27 July 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00282-4

zbMATH Keywords

Nordhaus-Gaddum typeCO-irredundance numberCO-irredundant set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

A lower bound for the CO-irredundance number of a graph ⋮ Enumeration and maximum number of maximal irredundant sets for chordal graphs ⋮ Irredundance ⋮ Signed domination numbers of a graph and its complement

This page was built for publication: Nordhaus-Gaddum results for CO-irredundance in graphs