Signless Laplacian spectral characterization of line graphs ofT-shape trees
From MaRDI portal
Publication:2929490
DOI10.1080/03081087.2013.839668zbMath1303.05120OpenAlexW1975786937MaRDI QIDQ2929490
Jianfeng Wang, Qianglong Zhang, Francesco Belardo
Publication date: 12 November 2014
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2013.839668
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76)
Related Items (4)
Graphs determined by signless Laplacian spectra ⋮ Connected signed graphs L-cospectral to signed ∞-graphs ⋮ Spectral characterizations of signed lollipop graphs ⋮ Aα-spectral radius and measures of graph irregularity
Cites Work
- On the (signless) Laplacian spectral characterization of the line graphs of lollipop graphs
- A note on the signless Laplacian eigenvalues of graphs
- Spectral determination of graphs whose components are paths and cycles
- A note on the spectral characterization of dumbbell graphs
- On a signless Laplacian spectral characterization of \(T\)-shape trees
- The \(T\)-shape tree is determined by its Laplacian spectrum
- Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
- Starlike trees are determined by their Laplacian spectrum
- Signless Laplacians of finite graphs
- Spectral characterizations of lollipop graphs
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Erratum to ``The lollipop graph is determined by its \(Q\)-spectrum
- On the spectral characterizations of \(\infty \)-graphs
- Some results on the signless Laplacians of graphs
- A conjecture on the algebraic connectivity of connected graphs with fixed girth
- Developments on spectral characterizations of graphs
- On graphs whose signless Laplacian index does not exceed 4.5
- The lollipop graph is determined by its \(Q\)-spectrum
- A note on the spectral characterization of \(\theta \)-graphs
- Which graphs are determined by their spectrum?
- Enumeration of cospectral graphs.
- Spectral characterizations of graphs with small spectral radius
- On graphs whose Laplacian index does not exceed 4.5
- On the spectral characterization of T-shape trees
- The line graphs of lollipop graphs are determined by their spectra
- Spectral characterization of line graphs of starlike trees
- Laplacian spectral characterization of disjoint union of paths and cycles
- Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra
- The Laplacian Spectrum of a Graph
- Eigenvalue bounds for the signless laplacian
- Towards a spectral theory of graphs based on the signless Laplacian, I
- Towards a spectral theory of graphs based on the signless Laplacian, III
This page was built for publication: Signless Laplacian spectral characterization of line graphs ofT-shape trees