Geodesic
The chromatic number and the least eigenvalue of a graph
The electronic journal of combinatorics, Tome 19 (2012) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In this paper we get a structural property for a graph having the minimal least eigenvalue among all graphs of fixed order and given chromatic number, and characterize such graphs under the condition that the chromatic number is not larger than half the order of the graph. As a result, we obtain a lower bound on the least eigenvalue in terms of the chromatic number, and an upper bound on the chromatic number in terms of the least eigenvalue of a graph.
DOI : 10.37236/2043
Classification : 05C50, 05C15, 15A18
Mots-clés : minimal least eigenvalue 
@article{10_37236_2043,
     author = {Yi-Zheng Fan and Gui-Dong Yu and Yi Wang},
     title = {The chromatic number and the least eigenvalue of a graph},
     journal = {The electronic journal of combinatorics},
     year = {2012},
     volume = {19},
     number = {1},
     doi = {10.37236/2043},
     zbl = {1243.05146},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2043/}
}
TY  - JOUR
AU  - Yi-Zheng Fan
AU  - Gui-Dong Yu
AU  - Yi Wang
TI  - The chromatic number and the least eigenvalue of a graph
JO  - The electronic journal of combinatorics
PY  - 2012
VL  - 19
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2043/
DO  - 10.37236/2043
ID  - 10_37236_2043
ER  - 
%0 Journal Article
%A Yi-Zheng Fan
%A Gui-Dong Yu
%A Yi Wang
%T The chromatic number and the least eigenvalue of a graph
%J The electronic journal of combinatorics
%D 2012
%V 19
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/2043/
%R 10.37236/2043
%F 10_37236_2043
Yi-Zheng Fan; Gui-Dong Yu; Yi Wang. The chromatic number and the least eigenvalue of a graph. The electronic journal of combinatorics, Tome 19 (2012) no. 1. doi: 10.37236/2043

Cité par Sources :