Cargando…

The Smallest Spectral Radius of Graphs with a Given Clique Number

The first four smallest values of the spectral radius among all connected graphs with maximum clique size ω ≥ 2 are obtained.

Detalles Bibliográficos
Autores principales: Zhang, Jing-Ming, Huang, Ting-Zhu, Guo, Ji-Ming
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2014
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4121196/
https://www.ncbi.nlm.nih.gov/pubmed/25121112
http://dx.doi.org/10.1155/2014/232153
Descripción
Sumario:The first four smallest values of the spectral radius among all connected graphs with maximum clique size ω ≥ 2 are obtained.