Name
Abstract | ||
|---|---|---|
We consider the set Gn,k of graphs of order n with the chromatic number k≥2. In this note, we prove that in Gn,k the Turán graph Tn,k has the maximal spectral radius; and Pn if k=2, Cn if k=3 and n is odd, Cn−11 if k=3 and n is even, Kk(l) if k≥4 has the minimal spectral radius. Thus we answer a problem raised by Cao [D.S. Cao, Index function of graphs, J. East China Norm. Univ. Sci. Ed. 4 (1987) 1–8 (in Chinese). MR89m:05084] and Hong [Y. Hong, Bounds of eigenvalues of graphs, Discrete Math. 123 (1993) 65–74] in the affirmative. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.aml.2005.11.030 | Applied Mathematics Letters |
Keywords | Field | DocType |
Chromatic number,Spectral radius | Spectral radius,Chromatic scale,Mathematical analysis,Eigenvalues and eigenvectors,Ordered set,Graph,Discrete mathematics,Mathematical optimization,Combinatorics,Turán graph,Radius,Index function,Mathematics | Journal |
Volume | Issue | ISSN |
20 | 2 | 0893-9659 |
Citations | PageRank | References |
6 | 0.81 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lihua Feng | 1 | 61 | 14.50 |
| Qiao Li | 2 | 59 | 3.61 |
| Xiao-Dong Zhang | 3 | 97 | 19.87 |