dc.creator | Abreu, Nair | |
dc.creator | Lenes, Eber | |
dc.creator | Rojo, Óscar | |
dc.date | 2015-12-01 | |
dc.identifier | http://www.revistaproyecciones.cl/article/view/1244 | |
dc.identifier | 10.4067/S0716-09172015000400006 | |
dc.description | 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. | es-ES |
dc.format | application/pdf | |
dc.language | spa | |
dc.publisher | Universidad Católica del Norte. | es-ES |
dc.relation | http://www.revistaproyecciones.cl/article/view/1244/957 | |
dc.rights | Derechos de autor 2015 Proyecciones. Journal of Mathematics | es-ES |
dc.source | Proyecciones. Journal of Mathematics; Vol 34 No 4 (2015); 379-390 | en-US |
dc.source | Proyecciones. Revista de Matemática; Vol. 34 Núm. 4 (2015); 379-390 | es-ES |
dc.source | 0717-6279 | |
dc.source | 0716-0917 | |
dc.title | Computing the maximal signless Laplacian index among graphs of prescribed order and diameter | es-ES |
dc.type | info:eu-repo/semantics/article | |
dc.type | info:eu-repo/semantics/publishedVersion | |
dc.type | Artículo revisado por pares | es-ES |