Operations on Covering Numbers of Certain Graph Classes
Susanth C, Sunny Joseph Kalayathankal
TL;DR
This paper investigates the relationships between the independence numbers of graphs and their complements, introduces operations on these numbers, and offers new characterizations of specific graph classes.
Contribution
It presents novel operations on independence numbers and provides new characterizations of certain graph classes, expanding understanding of graph invariants.
Findings
New bounds on independence numbers and their operations
Characterization of specific graph classes based on independence numbers
Insights into relationships between graphs and their complements
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Advanced Graph Theory Research · Graph theory and applications