Operations on Covering Numbers of Certain Graph Classes
classification
🧮 math.CO
keywords
graphnumberscertainclassescomplementoperationsboundscharacterization
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 operations on the Independence numbers of graphs with their complement. We also provide a new characterization of certain graph classes.
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.