A -shape tree is a tree with exactly one vertex of maximum degree 3. The line graphs of the -shape trees are triangles with a hanging path at each vertex. Let be such a graph, where, and are the lengths of the paths. In this paper, we show that line graphs of -shape trees, with the sole exception of, are determined by the spectra of their signless Laplacian matrices. For the graph we identify the unique non-isomorphic graph sharing the same signless Laplacian characteristic polynomial. © 2013 Taylor & Francis.
Signless Laplacian spectral characterization of line graphs of T-shape trees
BELARDO, FRANCESCO;
2014-01-01
Abstract
A -shape tree is a tree with exactly one vertex of maximum degree 3. The line graphs of the -shape trees are triangles with a hanging path at each vertex. Let be such a graph, where, and are the lengths of the paths. In this paper, we show that line graphs of -shape trees, with the sole exception of, are determined by the spectra of their signless Laplacian matrices. For the graph we identify the unique non-isomorphic graph sharing the same signless Laplacian characteristic polynomial. © 2013 Taylor & Francis.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.
