Spectral characterization of line graphs of starlike trees
Authors:
- 1 August 2013
- journal article
- research article
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 61 (8) , 1041-1050
Abstract
Two graphs are said to be A-cospectral if they have the same adjacency spectrum. A graph G is said to be determined by its adjacency spectrum if there is no other non-isomorphic graph A-cospectral with G. A tree is called starlike if it has exactly one vertex of degree greater than 2. In this article, we prove that the line graphs of starlike trees with maximum degree at least 12 are determined by their adjacency spectra.Keywords
This publication has 23 references indexed in Scilit:
- Signless Laplacian spectral characterization of the cones over some regular graphsLinear Algebra and its Applications, 2012
- Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphsDiscrete Mathematics, 2012
- Starlike trees whose maximum degree exceed 4 are determined by their Q-spectraLinear Algebra and its Applications, 2012
- Spectra of Graphs2012
- On conjectures involving second largest signless Laplacian eigenvalue of graphsLinear Algebra and its Applications, 2010
- The Lollipop Graph is Determined by its SpectrumThe Electronic Journal of Combinatorics, 2008
- Eigenvalue bounds for the signless laplacianPublications de l'Institut Mathematique, 2007
- Cospectral graphs with least eigenvalue at least -2Publications de l'Institut Mathematique, 2005
- Spectral Generalizations of Line Graphs2004
- Line graphs, root systems, and elliptic geometryJournal of Algebra, 1976