The Smallest Spectral Radius of Graphs with a Given Clique Number

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:TheScientificWorld 2014-01, Vol.2014 (2014), p.1-9
Hauptverfasser: Zhang, Jing-Ming, Guo, Ji-Ming, Huang, Ting-Zhu
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Colleges & universities
Graphic methods
Graphs
Mathematical functions
Mathematical research
Mathematics - methods
Matrices
Science
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The first four smallest values of the spectral radius among all connected graphs with maximum clique size ω ≥ 2 are obtained.
ISSN:2356-6140
1537-744X
1537-744X
DOI:10.1155/2014/232153