Spectral characterization of line graphs of starlike trees
From MaRDI portal
Publication:2850998
DOI10.1080/03081087.2012.733386zbMath1272.05169OpenAlexW1995557629MaRDI QIDQ2850998
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76)
Related Items (9)
Signless Laplacian determination for a family of double starlike trees ⋮ Laplacian spectral characterization of some graph join ⋮ Signless Laplacian spectral characterization of line graphs ofT-shape trees ⋮ On the eigenvalues and spectral radius of starlike trees ⋮ Line star sets for Laplacian eigenvalues ⋮ Unnamed Item ⋮ Graphs with least eigenvalue \(-2\): ten years on ⋮ The kite graph is determined by its adjacency spectrum ⋮ Main Q-eigenvalues and generalized Q-cospectrality of graphs
Cites Work
- Signless Laplacian spectral characterization of the cones over some regular graphs
- Laplacian spectral characterization of some graphs obtained by product operation
- Laplacian spectral characterization of some graph products
- Starlike trees whose maximum degree exceed 4 are determined by their Q-spectra
- Spectra of graphs
- On spectral characterization and embeddings of graphs
- Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs
- On a signless Laplacian spectral characterization of \(T\)-shape trees
- Spectral characterizations of lollipop graphs
- On conjectures involving second largest signless Laplacian eigenvalue of graphs
- Developments on spectral characterizations of graphs
- The lollipop graph is determined by its \(Q\)-spectrum
- Line graphs, root systems, and elliptic geometry
- Which graphs are determined by their spectrum?
- Spectral characterizations of graphs with small spectral radius
- Some results on starlike and sunlike graphs
- On the spectral characterization of T-shape trees
- The line graphs of lollipop graphs are determined by their spectra
- Cospectral graphs with least eigenvalue at least -2
- Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra
- Eigenvalue bounds for the signless laplacian
This page was built for publication: Spectral characterization of line graphs of starlike trees