论文信息 - Starlike trees whose maximum degree exceed 4 are determined by their Q-spectra

Starlike trees whose maximum degree exceed 4 are determined by their Q-spectra

Abstract Let A ( G ) and D ( G ) be the adjacency matrix and the degree matrix of a graph G , respectively. The matrix D ( G ) + A ( G ) is called the signless Laplacian matrix of G . The spectrum of the matrix D ( G ) + A ( G ) is called the Q-spectrum of G . A graph is said to be determined by its Q-spectrum if there is no other non-isomorphic graph with the same Q-spectrum. In this paper, we prove that all starlike trees whose maximum degree exceed 4 are determined by their Q-spectra.

Changjiang Bu | Jiang Zhou

[1] Mirko Lepovic,et al. No starlike trees are cospectral , 2002, Discret. Math..

[2] STARLIKE TREES WITH MAXIMUM DEGREE 4 ARE DETERMINED BY THEIR SIGNLESS LAPLACIAN SPECTRA , 2010 .

[3] Gholamreza Omidi. On a signless Laplacian spectral characterization of T-shape trees , 2009 .

[4] K. Tajbakhsh,et al. Starlike trees are determined by their Laplacian spectrum , 2007 .

[5] B. Tayfeh-Rezaie,et al. Graphs cospectral with starlike trees , 2008 .

[6] D. Cvetkovic,et al. Signless Laplacians of finite graphs , 2007 .

[7] Francesco Belardo,et al. On graphs whose signless Laplacian index does not exceed 4.5 , 2009 .

[8] Wei Wang,et al. On the spectral characterization of T-shape trees , 2006 .

[9] Wei Wang,et al. Note: The T-shape tree is determined by its Laplacian spectrum , 2006 .

[10] Dragos Cvetkovic,et al. An Introduction to the Theory of Graph Spectra: Frontmatter , 2009 .