Operations on Covering Numbers of Certain Graph Classes
Combinatorics
2015-06-11 v1
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.
Keywords
Cite
@article{arxiv.1506.03251,
title = {Operations on Covering Numbers of Certain Graph Classes},
author = {Susanth C and Sunny Joseph Kalayathankal},
journal= {arXiv preprint arXiv:1506.03251},
year = {2015}
}
Comments
8 Pages, Submitted. arXiv admin note: substantial text overlap with arXiv:1409.5871