Abstract
In the present paper, we compare the geometric–arithmetic index GA and the chromatic number χ of a connected graph with given order. We prove, among other results, an upper bound on the ratio GA∕χ. We also prove lower bounds on the chromatic number in terms of geometric–arithmetic index and number of vertices of a connected graph. The results obtained for the chromatic number χ are extended to the clique number ω.
Original language | English |
---|---|
Pages (from-to) | 207-212 |
Number of pages | 6 |
Journal | Discrete Applied Mathematics |
Volume | 232 |
DOIs | |
Publication status | Published - Dec 11 2017 |
Externally published | Yes |
Keywords
- Chromatic number
- Clique number
- Conjecture
- Geometric–arithmetic index
- Graph
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics