×

Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra. (English) Zbl 1205.05151

Summary: A graph is said to be determined by its signless Laplacian spectrum if there is no other non-isomorphic graph with the same spectrum. In this paper, it is shown that each starlike tree with maximum degree 4 is determined by its signless Laplacian spectrum.

MSC:

05C50 Graphs and linear algebra (matrices, eigenvalues, etc.)
05C05 Trees
PDF BibTeX XML Cite
Full Text: DOI EuDML EMIS Link