2015/06/10 by C Susanth, C, Susanth, Sunny Joseph Kalayathankal +1
Computer Science · Mathematics · #05C15 #05C69 #05C70 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications
paper · pdf · doi:10.48550/arxiv.1506.03251
openalex publication_date 2015/06/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.