The minimum spectral radius of graphs with a given clique number
The electronic journal of linear algebra, Tome 17 (2008), pp. 110-117.

Voir la notice de l'article provenant de la source Electronic Library of Mathematics

Summary: In this paper, it is shown that among connected graphs with maximum clique size $\omega $, the minimum value of the spectral radius of adjacency matrix is attained for a kite graph P K n - $\omega ,\omega $, which consists of a complete graph K $\omega $to a vertex of which a path P n - $\omega $is attached. For any fixed $\omega $, a small interval to which the spectral radii of kites P K m,$\omega $, m $\geq 1$, belong is exhibited.
Classification : 05C35, 05C50, 05C69
Keywords: adjacency matrix, largest eigenvalue, spectral radius, clique number, kite graph
@article{ELA_2008__17__a35,
     author = {Stevanovi\'c, Dragan and Hansen, Pierre},
     title = {The minimum spectral radius of graphs with a given clique number},
     journal = {The electronic journal of linear algebra},
     pages = {110--117},
     publisher = {mathdoc},
     volume = {17},
     year = {2008},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ELA_2008__17__a35/}
}
TY  - JOUR
AU  - Stevanović, Dragan
AU  - Hansen, Pierre
TI  - The minimum spectral radius of graphs with a given clique number
JO  - The electronic journal of linear algebra
PY  - 2008
SP  - 110
EP  - 117
VL  - 17
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ELA_2008__17__a35/
LA  - en
ID  - ELA_2008__17__a35
ER  - 
%0 Journal Article
%A Stevanović, Dragan
%A Hansen, Pierre
%T The minimum spectral radius of graphs with a given clique number
%J The electronic journal of linear algebra
%D 2008
%P 110-117
%V 17
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ELA_2008__17__a35/
%G en
%F ELA_2008__17__a35
Stevanović, Dragan; Hansen, Pierre. The minimum spectral radius of graphs with a given clique number. The electronic journal of linear algebra, Tome 17 (2008), pp. 110-117. http://geodesic.mathdoc.fr/item/ELA_2008__17__a35/