The signless Laplacian spectral radius of graphs with given degree sequences

The second Zagreb indices of graphs with given degree sequences

“…Definition 2.1 [17] Let G = (V, E) be a graph of root v 1 . A well-ordering ≺ of the vertices is called breadth-first search ordering with non-increasing degrees (BFSordering for short) if the following holds for all vertices u, v ∈ V :…”

Permanental Bounds for the Signless Laplacian Matrix of a Unicyclic Graph with Diameter d

“…The arguments given in [8,10,35] support the above idea. The second reason for the interest in the signless Laplacian matrix is that using Q-spectra to study graphs is more efficient than studying them by their (adjacency) spectra; see S. Li (B) · L. Zhang Faculty of Mathematics and Statistics, Central China Normal University, Wuhan 430079, People's Republic of China e-mail: lscmath@mail.ccnu.edu.cn [5,8,9,[11][12][13][14][16][17][18]20,21,30,37,38]. Another reason for the interest in the signless Laplacian matrix is that the set of signless Laplacian matrices is a class of non-negative matrices each of which has combinatorial significance.…”

The Signless Laplacian or Adjacency Spectral Radius of Bicyclic Graphs with Given Number of Cut Edges

“…The papers [11][12][13][14] give a survey on this work. The bounds of signless Laplacian spectral radius can be found in [10,20,27,37], and the relations between the spectral radius and graph parameters are discussed in [5,18,19,25,36,39,42]. The least signless Laplacian eigenvalues is also studied; see e.g.…”