A T-shape tree is a tree with exactly one vertex of maximum degree 3. The line graphs of the T-shape trees are triangles with a hanging path at each vertex. Let Ca,b,c be such a graph, where a, b and c are the lengths of the paths. In this paper, we show that line graphs of T-shape trees, with the sole exception of Ca,a,2a+1, are determined by the spectra of their signless Laplacian matrices. For the graph Ca,a,2a+1 we identify the unique non-isomorphic graph sharing the same signless Laplacian characteristic polynomial.
Signless Laplacian spectral characterization of line graphs of T-shape trees / Wang, Jian Feng; Belardo, Francesco; Zhang, Qiang Long. - In: LINEAR & MULTILINEAR ALGEBRA. - ISSN 0308-1087. - 62:11(2014), pp. 1529-1545. [10.1080/03081087.2013.839668]
Signless Laplacian spectral characterization of line graphs of T-shape trees
BELARDO, Francesco;
2014
Abstract
A T-shape tree is a tree with exactly one vertex of maximum degree 3. The line graphs of the T-shape trees are triangles with a hanging path at each vertex. Let Ca,b,c be such a graph, where a, b and c are the lengths of the paths. In this paper, we show that line graphs of T-shape trees, with the sole exception of Ca,a,2a+1, are determined by the spectra of their signless Laplacian matrices. For the graph Ca,a,2a+1 we identify the unique non-isomorphic graph sharing the same signless Laplacian characteristic polynomial.File | Dimensione | Formato | |
---|---|---|---|
Signless Laplacian spectral characterization of line graphs of T-shape trees.pdf
non disponibili
Descrizione: Articolo completo in Post-print
Tipologia:
Documento in Post-print
Licenza:
Accesso privato/ristretto
Dimensione
318.72 kB
Formato
Adobe PDF
|
318.72 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.