The theta-graph, denoted by theta(i,j,k), is a graph consisting of two given vertices joined by three paths whose order is i + 2, j + 2 and k + 2 respectively, with any two of these paths having only the given vertices in common. It is well-know that the problem of spectral characterization is related to the Huckel theory from Chemistry. In the paper we will show that the theta-graphs containing odd cycles and without no 4-cycles slid the theta-graphs with minimal spectral radius are determined by the adjacency spectrum.
On the spectral characterization of theta graphs
BELARDO, FRANCESCO;LI MARZI, Enzo
2009-01-01
Abstract
The theta-graph, denoted by theta(i,j,k), is a graph consisting of two given vertices joined by three paths whose order is i + 2, j + 2 and k + 2 respectively, with any two of these paths having only the given vertices in common. It is well-know that the problem of spectral characterization is related to the Huckel theory from Chemistry. In the paper we will show that the theta-graphs containing odd cycles and without no 4-cycles slid the theta-graphs with minimal spectral radius are determined by the adjacency spectrum.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.
