The spectral characterization of butterfly-like graphs
From MaRDI portal
(Redirected from Publication:344880)
Recommendations
- Corrigendum to: ``The spectral characterization of butterfly-like graphs
- On the spectral characterizations of graphs
- A survey on spectral characterizations of graphs
- On the spectral properties of Feigenbaum graphs
- Generalized spectral characterization of graphs revisited
- Spectra of graphs
- scientific article; zbMATH DE number 1219775
- The spectra of wrapped butterfly digraphs
- Spectral properties of some structurally related graphs
- scientific article; zbMATH DE number 867649
Cites work
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 3482387 (Why is no real title available?)
- A note on the second largest eigenvalue of the laplacian matrix of a graph∗
- Complete split graph determined by its (signless) Laplacian spectrum
- Graphs determined by their (signless) Laplacian spectra
- Laplacian matrices of graphs: A survey
- No starlike trees are cospectral
- On a signless Laplacian spectral characterization of \(T\)-shape trees
- On conjectures involving second largest signless Laplacian eigenvalue of graphs
- On the spectral characterizations of \(\infty \)-graphs
- Signless Laplacians of finite graphs
- Some graphs determined by their (signless) Laplacian spectra.
- Some results on starlike and sunlike graphs
- The Laplacian spectrum of a graph
- The spectral characterization of wind-wheel graphs
- Which graphs are determined by their spectrum?
Cited in
(19)- Determining some graph joins by the signless Laplacian spectrum
- The coalescence of multi-wheel and starlike graphs is DLS
- Laplacian spectral characterization of (broken) dandelion graphs
- Some degree sequences are determined by Laplacian spectra of the corresponding graphs
- Which \(Q\)-cospectral graphs have same degree sequences
- Monster graphs are determined by their Laplacian spectra
- Signless Laplacian spectral characterization of some disjoint union of graphs
- On (distance) signless Laplacian spectra of graphs
- Two classes of graphs determined by the signless Laplacian spectrum
- Which cospectral graphs have same degree sequences
- On the spectral characterization of graphs with respect to the normalized Laplacian
- Spectral radii of friendship graphs and their connected induced subgraphs
- The eccentricity spread of weak-friendship graphs
- A special class of triple starlike trees characterized by Laplacian spectrum
- Which Laplacian cospectral graphs have the same degree sequences?
- Signless Laplacian characterization of cones over disjoint unions of cycles, edges and isolated vertices
- Graphs whose second largest signless Laplacian eigenvalue does not exceed \(2+\sqrt{2}\)
- Corrigendum to: ``The spectral characterization of butterfly-like graphs
- Some graphs determined by their signless Laplacian (distance) spectra
This page was built for publication: The spectral characterization of butterfly-like graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344880)