Computing the maximal signless Laplacian index among graphs of prescribed order and diameter
Open Access
- 1 December 2015
- journal article
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 34 (4) , 379-390
Abstract
A bug Bugp,r1r2 is a graph obtained from a complete graph Kp by deleting an edge uv and attaching the paths Priand Pr2 by one of their end vertices at u and v, respectively. Let Q(G) be the signless Laplacian matrix of a graph G and q1(G) be the spectral radius of Q(G). It is known that the bug maximizes q1(G) among all graphs G of order n and diameter d. For a bug B of order n and diameter d, n - d is an eigenvalue of Q(B) with multiplicity n - d - 1. In this paper, we prove that remainder d +1 eigenvalues of Q(B), among them q1(B), can be computed as the eigenvalues of a symmetric tridiagonal matrix of order d +1. Finally, we show that q1(B0) can be computed as the largest eigenvalue of a symmetric tridiagonal matrix of order whenever d is even.Keywords
This publication has 5 references indexed in Scilit:
- A conjecture on the diameter and signless Laplacian index of graphsLinear Algebra and its Applications, 2014
- Eigenvalues of a H -generalized join graph operation constrained by vertex subsetsLinear Algebra and its Applications, 2013
- Bounds and conjectures for the signless Laplacian index of graphsLinear Algebra and its Applications, 2010
- On the maximal signless Laplacian spectral radius of graphs with given matching numberProceedings of the Japan Academy, Series A, Mathematical Sciences, 2008
- Eigenvalue bounds for the signless laplacianPublications de l'Institut Mathematique, 2007