arXiv:1506.03251 Abstract | arXiv Analytics

arXiv:1506.03251 [math.CO]Abstract References Reviews Resources

Operations on Covering Numbers of Certain Graph Classes

Published 2015-06-10Version 1

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.

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

Categories: math.CO

Subjects: 05C15, 05C69, 05C70

Keywords: graph classes, covering numbers, operations, chromatic numbers, complement

Related articles: Most relevant | Search more

arXiv:1304.2862 [math.CO] (Published 2013-04-10)

Complements of nearly perfect graphs

András Gyárfás, Zhentao Li, Raphael Machado, András Sebo, Stéphan Thomassé, Nicolas Trotignon

arXiv:1409.5871 [math.CO] (Published 2014-09-20)

The Sum and Product of Independence Numbers of Graphs and their Line Graphs

Susanth C, Sunny Joseph Kalayathankal

arXiv:1601.04642 [math.CO] (Published 2016-01-18)