Susanth, C and Kalayathankal, Sunny Joseph (2015) The Sum and Product of Chromatic Numbers of Graphs and their Line Graphs. British Journal of Mathematics & Computer Science, 12 (2). pp. 1-7. ISSN 22310851
![[thumbnail of Susanth1222015BJMCS20823.pdf]](http://research.europeanlibrarypress.com/style/images/fileicons/text.png)
Text
Susanth1222015BJMCS20823.pdf - Published Version
Download (509kB)
Official URL: https://doi.org/10.9734/BJMCS/2016/20823
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, some variations on this result is studies. First, recall their theorem, which gives bounds on the sum and the product of the chromatic number of a graph with that of its complement. We also provide a new characterization of the certain graph classes.
| Item Type: | Article |
|---|---|
| Subjects: | Souths Book > Mathematical Science |
| Depositing User: | Unnamed user with email support@southsbook.com |
| Date Deposited: | 07 Jul 2023 04:37 |
| Last Modified: | 13 Sep 2024 08:02 |
| URI: | http://research.europeanlibrarypress.com/id/eprint/1026 |
Actions (login required)
- View Item