Some graphs determined by their spectra
From MaRDI portal
Publication:840642
Recommendations
Cites work
- A certain polynomial of a graph and graphs with an extremal number of trees
- A new upper bound for eigenvalues of the Laplacian matrix of a graph
- A note on the second largest eigenvalue of the laplacian matrix of a graph∗
- Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
- Graphs with Exactly Two Negative Eigenvalues
- scientific article; zbMATH DE number 3414355 (Why is no real title available?)
- Laplacian matrices of graphs: A survey
- Laplacian spectra and spanning trees of threshold graphs
- On graphs with exactly one eigenvalue less than -1
- On the nullity of graphs
- On the spectral characterization of T-shape trees
- Problems in algebraic combinatorics
- Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
- Spectral characterizations of lollipop graphs
- Starlike trees are determined by their Laplacian spectrum
- The \(T\)-shape tree is determined by its Laplacian spectrum
- The complement of the path is determined by its spectrum
- The Laplacian Spectrum of a Graph II
- The multi-fan graphs are determined by their Laplacian spectra
- Which graphs are determined by their spectrum?
Cited in
(43)- Spectral characterizations of sandglass graphs
- Which graphs are determined by their spectrum?
- Kite graphs determined by their spectra
- Which cospectral graphs have same degree sequences
- A combinatorial formula for the Schur coefficients of chromatic symmetric functions
- Spectral characterization of unicyclic graphs whose second largest eigenvalue does not exceed 1
- A study on the pendant number of graph products
- Determining graphs by the complementary spectrum
- Zero forcing number of degree splitting graphs and complete degree splitting graphs
- The kite graph is determined by its adjacency spectrum
- Laplacian spectral characterization of some unicyclic graphs
- On the spectral characterizations of graphs
- The line graphs of lollipop graphs are determined by their spectra
- Laplacian spectral characterization of 3-rose graphs
- Some graphs determined by their (signless) Laplacian spectra
- On distance Laplacian spectral determination of complete multipartite graphs
- Graphs whose spectrum determined by non-constant coefficients
- Adjacent spectral characterization of complete bipartite graphs
- Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
- scientific article; zbMATH DE number 6679418 (Why is no real title available?)
- Some results on graph products determined by their spectra
- On the spectral characterization of pineapple graphs
- Laplacian spectral characterization of some graph join
- The spectral characterization of wind-wheel graphs
- Graphs determined by their (signless) Laplacian spectra
- Spectra of Some Graphs
- Spectral characterizations of sandglass graphs with a pendant edge
- Two families of spanning subgraphs of a complete graph determined by their spectra
- Some graphs determined by their (signless) Laplacian spectra.
- \(\mathrm{Kite}_{p+2,p}\) is determined by its Laplacian spectrum
- 3-sequent achromatic sum of graphs
- Laplacian spectral determination of path-friendship graphs
- On the spectral characterization of kite graphs
- Graphs determined by their \(T\)-gain spectra
- Vertex neighborhood restricted edge achromatic sums of graphs
- On the spectral characterization of the union of complete multipartite graph and some isolated vertices
- Spectral radii of friendship graphs and their connected induced subgraphs
- Induced dominating sequence and ESD graphs
- Induced geodetic sequence of a graph
- Geodetic number of cyclic graphs
- Edge incident 2-edge coloring of graphs
- The centipede is determined by its Laplacian spectrum
- Graphs with integral spectrum
This page was built for publication: Some graphs determined by their spectra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840642)
