Operations on Covering Numbers of Certain Graph Classes

C Susanth, Sunny Joseph Kalayathankal · arXiv (Cornell University) · 2015

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.

Read the paper · More papers on PaperTik