It is shown that for \( n \geq 16 \), the sum of cardinalities of open irredundant sets in an \( n \)-vertex graph and its complement is at most \( \frac{3n}{4} \).
Keywords: open irredundance, Nordhaus-Gaddum Subject Classification Number: 05C69
Citation
E.J. Cockayne. Nordhaus-Gaddum Results for Open Irredundance[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 047. 213-223. DOI: .
