The Smallest Spectral Radius of Graphs with a Given Clique Number
Joint Authors
Zhang, Jing-Ming
Guo, Ji-Ming
Huang, Ting-Zhu
Source
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-9, 9 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-07-10
Country of Publication
Egypt
No. of Pages
9
Main Subjects
Medicine
Information Technology and Computer Science
Abstract EN
The first four smallest values of the spectral radius among all connected graphs with maximum clique size ω ≥ 2 are obtained.
American Psychological Association (APA)
Zhang, Jing-Ming& Huang, Ting-Zhu& Guo, Ji-Ming. 2014. The Smallest Spectral Radius of Graphs with a Given Clique Number. The Scientific World Journal،Vol. 2014, no. 2014, pp.1-9.
https://search.emarefa.net/detail/BIM-1048810
Modern Language Association (MLA)
Zhang, Jing-Ming…[et al.]. The Smallest Spectral Radius of Graphs with a Given Clique Number. The Scientific World Journal No. 2014 (2014), pp.1-9.
https://search.emarefa.net/detail/BIM-1048810
American Medical Association (AMA)
Zhang, Jing-Ming& Huang, Ting-Zhu& Guo, Ji-Ming. The Smallest Spectral Radius of Graphs with a Given Clique Number. The Scientific World Journal. 2014. Vol. 2014, no. 2014, pp.1-9.
https://search.emarefa.net/detail/BIM-1048810
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1048810
