The smallest spectral radius of graphs with a given clique number

ScientificWorldJournal. 2014:2014:232153. doi: 10.1155/2014/232153. Epub 2014 Jul 13.

Authors

Jing-Ming Zhang¹, Ting-Zhu Huang², Ji-Ming Guo³

Affiliations

¹ 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.
² School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, China.
³ College of Science, East China University of Science and Technology, Shanghai 200237, China.

Abstract

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

Publication types

Research Support, Non-U.S. Gov't

MeSH terms

Algorithms*
Mathematics / methods*