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.
Saved in:
| Main Authors: | Jing-Ming Zhang, Ting-Zhu Huang, Ji-Ming Guo |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2014/232153 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Smallest cubic and quartic graphs with a given number of cutpoints and bridges
by: Gary Chartrand, et al.
Published: (1982-01-01) -
The Distance Laplacian Spectral Radius of Clique Trees
by: Xiaoling Zhang, et al.
Published: (2020-01-01) -
On the Signless Laplacian Spectral Radius of Bicyclic Graphs with Perfect Matchings
by: Jing-Ming Zhang, et al.
Published: (2014-01-01) -
A Note on the Signed Clique Domination Numbers of Graphs
by: Baogen Xu, et al.
Published: (2022-01-01) -
Comments on the Clique Number of Zero-Divisor Graphs of Zn
by: Yanzhao Tian, et al.
Published: (2022-01-01)