Article ID Journal Published Year Pages File Type
6416490 Linear Algebra and its Applications 2013 15 Pages PDF
Abstract

The signless Laplacian spectral radius of a graph G is the largest eigenvalue of its signless Laplacian matrix. In this paper, the first four smallest values of the signless Laplacian spectral radius among all connected graphs with maximum clique of size greater than or equal to 2 are obtained.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Algebra and Number Theory
Preview
The smallest signless Laplacian spectral radius of graphs with a given clique number
Authors
, , ,