Signless Laplacian spectral characterization of line graphs of T-shape trees
From MaRDI portal
Publication:2929490
Recommendations
- On the signless Laplacian spectral characterization of the line graphs of \(T\)-shape trees.
- Spectral determination of a class of tricyclic graphs.
- On a signless Laplacian spectral characterization of \(T\)-shape trees
- scientific article; zbMATH DE number 6383832
- On the spectral characterization of T-shape trees
Cites work
- A conjecture on the algebraic connectivity of connected graphs with fixed girth
- A note on the signless Laplacian eigenvalues of graphs
- A note on the spectral characterization of \(\theta \)-graphs
- A note on the spectral characterization of dumbbell graphs
- Developments on spectral characterizations of graphs
- Eigenvalue bounds for the signless laplacian
- Enumeration of cospectral graphs.
- Erratum to ``The lollipop graph is determined by its \(Q\)-spectrum
- Laplacian spectral characterization of disjoint union of paths and cycles
- On a signless Laplacian spectral characterization of \(T\)-shape trees
- On graphs whose Laplacian index does not exceed 4.5
- On graphs whose signless Laplacian index does not exceed 4.5
- On the (signless) Laplacian spectral characterization of the line graphs of lollipop graphs
- On the spectral characterization of T-shape trees
- On the spectral characterizations of \(\infty \)-graphs
- Signless Laplacians of finite graphs
- Some results on the signless Laplacians of graphs
- Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
- Spectral characterization of line graphs of starlike trees
- Spectral characterizations of graphs with small spectral radius
- Spectral characterizations of lollipop graphs
- Spectral determination of graphs whose components are paths and cycles
- Starlike trees are determined by their Laplacian spectrum
- Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra
- The Laplacian Spectrum of a Graph
- The \(T\)-shape tree is determined by its Laplacian spectrum
- The line graphs of lollipop graphs are determined by their spectra
- The lollipop graph is determined by its Q-spectrum
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Towards a spectral theory of graphs based on the signless Laplacian. I
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Which graphs are determined by their spectrum?
Cited in
(10)- Graphs determined by signless Laplacian spectra
- A simple characterization of the spectral uniqueness of the \(T\)-shape trees
- On the signless Laplacian spectral characterization of the line graphs of \(T\)-shape trees.
- On the (signless) Laplacian spectral characterization of the line graphs of lollipop graphs
- Signless Laplacian determination for a family of double starlike trees
- Connected signed graphs \(L\)-cospectral to signed \(\infty\)-graphs
- On a signless Laplacian spectral characterization of \(T\)-shape trees
- Spectral characterizations of signed lollipop graphs
- On the spectral characterization of T-shape trees
- Aα-spectral radius and measures of graph irregularity
This page was built for publication: Signless Laplacian spectral characterization of line graphs of \(T\)-shape trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2929490)