Elsevier

Discrete Mathematics

Volume 211, Issues 1–3, 28 January 2000, Pages 209-215
Discrete Mathematics

Note
Nordhaus–Gaddum results for CO-irredundance in graphs

https://doi.org/10.1016/S0012-365X(99)00282-4Get rights and content
Under an Elsevier user license
open archive

Abstract

We prove that the sum and product of upper CO-irredundance numbers of an n-vertex graph and its complement are bounded above by n+2,(n+2)2/4, respectively, and exhibit extremal graphs for these inequalities.

Cited by (0)