arXiv Analytics

Sign in

arXiv:1409.5871 [math.CO]AbstractReferencesReviewsResources

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

Susanth C, Sunny Joseph Kalayathankal

Published 2014-09-20Version 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 bounds on the sum and product of the independence numbers of graphs and their line graphs.

Comments: 11 Pages
Categories: math.CO
Subjects: 05C69, 05C70
Related articles: Most relevant | Search more
arXiv:2308.01685 [math.CO] (Published 2023-08-03)
Inequalities Connecting the Annihilation and Independence Numbers
arXiv:2212.14323 [math.CO] (Published 2022-12-29)
Independence numbers of polyhedral graphs
arXiv:2406.03355 [math.CO] (Published 2024-06-05)
Nordhaus-Gaddum inequalities for the number of cliques in a graph

Links

Toolbox