G-2007-44
The Minimum Spectral Radius of Graphs with a Given Clique Number
and BibTeX reference
We show that among connected graphs with maximum clique size , the minimum value of the spectral radius of adjacency matrix is attained for a kite graph
,
which consists of a complete graph
to a vertex of which a path
is attached.
For any fixed
,
a small interval to which the spectral radii of kites
belong is exhibited.
Published July 2007 , 14 pages
Research Axis
Research applications
Document
G-2007-44.pdf (100 KB)