Bibliographic Details
| Title: |
On the Chromatic Number and Connectivity of Delta-Color Complement of Graphs. |
| Authors: |
S. R., Sahana1 saanu5659@gmail.com, D'Souza, Sabitha2 sabitha.dsouza@manipal.edu, Nayak, Swati1 swati.nayak@manipal.edu |
| Source: |
Engineering Letters. Jun2026, Vol. 34 Issue 6, p2396-2400. 5p. |
| Subjects: |
Graph coloring, Graph connectivity, Graph theory |
| Abstract: |
Let G, = (V,E) be a finite, simple, colored graph of order n and size m. In this study, we focus on the coloring characteristics of d-color complement of graphs. Specifically, we establish both lower and upper bounds for the product and the sum involving and dc, drawing parallels with the classical Nordhaus-Gaddum type inequalities. We also identify graph families that attain these bounds. Compute the dc and d x c-chromatic numbers of certain graphs. Inspired by the foundational work of Nordhaus and Gaddum, we derive bounds on maximum degree, minimum degree, vertex connectivity, and edge connectivity of a graph G, and its d-color complement. [ABSTRACT FROM AUTHOR] |
|
Copyright of Engineering Letters is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
