The index of a graph is the largest eigenvalue (or spectral radius) of its adjacency matrix. We consider the problem of ordering graphs by the index in the class of connected graphs with a fixed order n and index belonging to the interval (2, sqrt(2 + sqrt(5))). For any fixed n (provided that n is not too small), we order a significant portion of graphs whose indices are close to the end points of the above interval. © 2007 Elsevier B.V. All rights reserved.
Ordering graphs with index in the interval (2, root 2+root 5)
BELARDO, FRANCESCO;LI MARZI, Enzo;
2008-01-01
Abstract
The index of a graph is the largest eigenvalue (or spectral radius) of its adjacency matrix. We consider the problem of ordering graphs by the index in the class of connected graphs with a fixed order n and index belonging to the interval (2, sqrt(2 + sqrt(5))). For any fixed n (provided that n is not too small), we order a significant portion of graphs whose indices are close to the end points of the above interval. © 2007 Elsevier B.V. All rights reserved.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
