Department of Mathematics
The smallest Laplacian spectral radius of graphs with a given clique number
The Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix. In this paper, the first three smallest values of the Laplacian spectral radii among all connected graphs with clique number ω are obtained. © 2012 Elsevier Inc. All rights reserved.
Clique number, Laplacian characteristic polynomial, Laplacian spectral radius
Source Publication Title
Linear Algebra and its Applications
Link to Publisher's Edition
Guo, Ji-Ming, Jianxi Li, and Wai Chee Shiu. "The smallest Laplacian spectral radius of graphs with a given clique number." Linear Algebra and its Applications 437.4 (2012): 1109-1122.