Computing the maximal signless Laplacian index among graphs of prescribed order and diameter

• Abreu, Nair ^[1] ; Lenes, Eber ^[2] ; Rojo, Óscar
  1. [1] Universidade Federal do Rio de Janeiro

     Universidade Federal do Rio de Janeiro

     Brasil

     
  2. [2] Universidad del Sinú

     Universidad del Sinú

     Colombia

     
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 34, Nº. 4, 2015, págs. 379-390
• Idioma: inglés
• DOI: 10.4067/S0716-09172015000400006
• Enlaces
  • Texto completo
• Resumen

  • 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.

• Referencias bibliográficas
  • Citas [1] D. M. Cardoso, M. A. A. de Freitas, E. Martins., M. Robbiano, Spectra of graphs obtained by a generalization of the join graph...
  • [2] D. M. Cardoso, E. Martins., M. Robbiano, O. Rojo, Eigenvalues of a H-generalized operation constrained by vertex subsets, Linear Algebra...
  • [3] H. Liu, M. Lu, A conjecture on the diameter and signless Laplacian index of graphs, Linear Algebra Appl. 450, pp. 158-174, (2014).
  • [4] D. Cvetkovi´c, P. Rowlinson, S.K. Simi´c, Eigenvalue bounds for the signless Laplacian, Publications de L’Institute Math´ematique, Nouvelle...
  • [5] P. Hansen, C. Lucas, Bounds and conjectures for the signless Laplacian index of graphs, Linear Algebra Appl. 432, pp. 3319-3336, (2010).
  • [6] Miao-Lin Ye, Yi-Zheng Fan, Hai Feng Wang, Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity,...
  • [7] G. Yu, On the maximal signless Laplacian spectral radius of graphs with given matching number, Proc. Japan Acad. Ser. A 84, pp. 163- 166,...