paper

Operations on Covering Numbers of Certain Graph Classes

arXiv:1506.03251

Abstract

The bounds on the sum and product of chromatic numbers of a graph and its complement are known as Nordhaus-Gaddum inequalities. In this paper, we study the operations on the Independence numbers of graphs with their complement. We also provide a new characterization of certain graph classes.

8 Pages, Submitted. arXiv admin note: substantial text overlap with arXiv:1409.5871

References in corpus (1)

Operations on Covering Numbers of Certain Graph Classes · wovepaper