title: The smallest spectral radius of graphs with a given clique number.
abstract: The first four smallest values of the spectral radius among all connected graphs with maximum clique size ω ≥ 2 are obtained.
authors.affiliation: School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, China ; College of Science, China University of Petroleum, Qingdao, Shandong 266580, China.
authors.forename: Jing-Ming
authors.initials: JM
authors.lastname: Zhang
authors.affiliation: School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, China.
authors.forename: Ting-Zhu
authors.initials: TZ
authors.lastname: Huang
authors.affiliation: College of Science, East China University of Science and Technology, Shanghai 200237, China.
authors.forename: Ji-Ming
authors.initials: JM
authors.lastname: Guo
mesh_terms: D000465:Algorithms; D008433:Mathematics / Q000379:methods*