Computing the maximal signless Laplacian index among graphs of prescribed order and diameter
A bug Bug p,r1r2 is a graph obtained from a complete graph Kp by deleting an edge uv and attaching the paths Pri and 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<...
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Langue: | English |
| Publié: |
Universidad Católica del Norte, Departamento de Matemáticas
2015
|
| Sujets: | |
| Accès en ligne: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172015000400006 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|