Title of article
Nordhaus–Gaddum results for CO-irredundance in graphs
Author/Authors
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.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
7
From page
209
To page
215
Abstract
E.J. Cockayne, D. McCrea, C.M. Mynhardt
Journal title
Discrete Mathematics
Serial Year
2000
Journal title
Discrete Mathematics
Record number
950296
Link To Document