Spectral characterization of line graphs of starlike trees

DOI10.1080/03081087.2012.733386MaRDI QIDQ2850998zbMATH OpenOpenAlexFDO

Authors Jiang Zhou, Changjiang Bu

Publication date 1 October 2013

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081087.2012.733386

zbMATH Keywords

adjacency matrixcospectral graphssignless Laplacian matrixstarlike treegeneralized line graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Starlike trees are determined by their Laplacian spectrum
• Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra
• scientific article; zbMATH DE number 2185948
• A special class of triple starlike trees characterized by Laplacian spectrum
• No star-like trees are Laplacian co-spectral

Cites work

• Cospectral graphs with least eigenvalue at least -2
• Developments on spectral characterizations of graphs
• Eigenvalue bounds for the signless laplacian
• Laplacian spectral characterization of some graph products
• Laplacian spectral characterization of some graphs obtained by product operation
• Line graphs, root systems, and elliptic geometry
• On a signless Laplacian spectral characterization of \(T\)-shape trees
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• On spectral characterization and embeddings of graphs
• On the spectral characterization of T-shape trees
• Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs
• Signless Laplacian spectral characterization of the cones over some regular graphs
• Some results on starlike and sunlike graphs
• Spectra of graphs
• Spectral characterizations of graphs with small spectral radius
• Spectral characterizations of lollipop graphs
• Starlike trees whose maximum degree exceed 4 are determined by their Q-spectra
• Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra
• The line graphs of lollipop graphs are determined by their spectra
• The lollipop graph is determined by its Q-spectrum
• Which graphs are determined by their spectrum?

Cited in

(13)

• Main Q-eigenvalues and generalized Q-cospectrality of graphs
• Notes on graphs with least eigenvalue at least -2
• Coefficients of characteristic polynomials of starlike trees
• The kite graph is determined by its adjacency spectrum
• Signless Laplacian spectral characterization of line graphs of T-shape trees
• Laplacian spectral characterization of some graph join
• Signless Laplacian determination for a family of double starlike trees
• Line star sets for Laplacian eigenvalues
• On the eigenvalues and spectral radius of starlike trees
• Graphs cospectral with starlike trees
• Peculiar spectral statistics of ensembles of trees and star-like graphs
• Graphs with least eigenvalue -2: ten years on
• Signless Laplacian spectral determination of path-friendship graphs

This page was built for publication: Spectral characterization of line graphs of starlike trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2850998)