The Sum and Product of Independence Numbers of Graphs and their Line Graphs
classification
🧮 math.CO
keywords
graphsnumbersproductboundsindependencelinechromaticcomplement
read the original 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 bounds on the sum and product of the independence numbers of graphs and their line graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.