Which graphs are determined by their spectrum?
From MaRDI portal
Redirect page
Redirect to:
Recommendations
- scientific article; zbMATH DE number 6679418
- Some graphs determined by their spectra
- Which graphs have non-integral spectra?
- Which wheel graphs are determined by their Laplacian spectra?
- Some graphs determined by their distance spectrum
- Graphs whose spectrum determined by non-constant coefficients
- scientific article; zbMATH DE number 4177110
- Determining graphs by the complementary spectrum
- Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
Cites work
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 3152621 (Why is no real title available?)
- scientific article; zbMATH DE number 3877205 (Why is no real title available?)
- scientific article; zbMATH DE number 3779374 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3482386 (Why is no real title available?)
- scientific article; zbMATH DE number 3528270 (Why is no real title available?)
- scientific article; zbMATH DE number 3627232 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 782054 (Why is no real title available?)
- scientific article; zbMATH DE number 874569 (Why is no real title available?)
- scientific article; zbMATH DE number 3225111 (Why is no real title available?)
- scientific article; zbMATH DE number 3259777 (Why is no real title available?)
- scientific article; zbMATH DE number 3377258 (Why is no real title available?)
- scientific article; zbMATH DE number 3407720 (Why is no real title available?)
- scientific article; zbMATH DE number 3411062 (Why is no real title available?)
- A computer-assisted proof of the uniqueness of the Perkel graph
- A new 5‐arc‐transitive cubic graph
- A note on cospectral graphs
- Almost all trees share a complete set of immanantal polynomials
- Asymptotic enumeration of Latin rectangles
- Can One Hear the Shape of a Drum?
- Classification of regular two-graphs on 36 and 38 vertices
- Combinatorial designs with two singular values. I: Uniform multiplicative designs
- Combinatorial matrix theory
- Constructing cospectral graphs
- Constructing trees with given eigenvalues and angles
- Distance-regularity and the spectrum of graphs
- Enumeration of cospectral graphs.
- From local adjacency polynomials to locally pseudo-distance-regular graphs
- Generation of isospectral graphs
- Graphs cospectral with distance-regular graphs
- Graphs with Maximal Even Girth
- Graphs with constant \(\mu\) and \(\overline{\mu}\)
- Isospectral graphs and isoperimetric constants
- Large families of cospectral graphs
- Large families of laplacian isospectral graphs
- Line graphs, root systems, and elliptic geometry
- No starlike trees are cospectral
- Non-Sunada graphs
- Nonregular graphs with three eigenvalues
- On hearing the shape of a drum
- On the Polynomial of a Graph
- Reconstruction of weighted graphs by their spectrum
- Regular graphs with four eigenvalues
- Small regular graphs with four eigenvalues
- Spectral characterization of some generalized odd graphs
- Spectral characterizations of some distance-regular graphs
- Spektren endlicher Grafen
- Strongly regular graphs having strongly regular subconstituents
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- Strongly regular graphs, partial geometries and partially balanced designs
- Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph
- The Gewirtz graph: An exercise in the theory of graph spectra
- The Uniqueness of the $\mathrm{L}_2$ Association Scheme
- The characteristic polynomials of modified graphs
- The complement of the path is determined by its spectrum
- The regular two-graph on 276 vertices
- The uniqueness of the strongly regular graph on 77 points
Cited in
(only showing first 100 items - show all)- Laplacian spectral characterization of disjoint union of paths and cycles
- On the expressive power of linear algebra on graphs
- Generating all regular rational orthogonal matrices
- Graphs (networks) with golden spectral ratio
- Generalized spectral characterization of signed trees
- Spectral characterizations of sandglass graphs
- On the roots of total domination polynomial of graphs. II
- On the construction of cospectral nonisomorphic bipartite graphs
- An odd characterization of the generalized odd graphs
- Main Q-eigenvalues and generalized Q-cospectrality of graphs
- A survey on spectral characterizations of graphs
- Bell Graphs are Determined by their Laplacian Spectra
- Spectral characterization of the complete graph removing a cycle
- New upper bound on the largest Laplacian eigenvalue of graphs
- An arithmetic criterion for graphs being determined by their generalized \(A_\alpha \)-spectra
- Co-eigenvector graphs
- Determining some graph joins by the signless Laplacian spectrum
- Distinguishing graphs by their spectra, Smith normal forms and complements
- Generalized distance spectral characterizations of graphs based on Smith norm form
- The graphs with all but two eigenvalues equal to \(\pm 1\)
- Ihara zeta functions and cospectrality of joins of regular graphs
- E-cospectral hypergraphs and some hypergraphs determined by their spectra
- Graphs determined by signless Laplacian spectra
- Lov\'asz Meets Weisfeiler and Leman
- An improved condition for a graph to be determined by its generalized spectrum
- Laplacian spectral characterization of clover graphs
- On the expressive power of linear algebra on graphs
- Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
- Laplacian spectral characterization of some graphs obtained by product operation
- Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter d
- Distance-regular Cayley graphs with least eigenvalue \(-2\)
- The coalescence of multi-wheel and starlike graphs is DLS
- On the symmetric doubly stochastic matrices that are determined by their spectra and their connection with spectral graph theory
- On maximum signless Laplacian Estrada index of graphs with given parameters. II
- Eigenvalues and energy in threshold graphs
- A note on the spectral characterization of strongly connected bicyclic digraphs
- Spectral clustering of combinatorial fullerene isomers based on their facet graph structure
- The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs
- Unoriented Laplacian maximizing graphs are degree maximal
- The Complexity of Homomorphism Indistinguishability
- Structural properties and formulae of the spectra of integral circulant graphs
- Two Laplacians for the distance matrix of a graph
- Some notes on the spectral perturbations of the signless Laplacian of a graph
- Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
- Spectral characterizations of almost complete graphs
- On the spectral characterization of \(\Pi\)-shape trees
- \( A_\alpha\)-spectral characterizations of some joins
- On the restricted numerical range of the Laplacian matrix for digraphs
- On the nonexistence of pseudo-generalized quadrangles
- The spectral characterization of \(\infty\)-graphs
- On the spectral characterization of some unicyclic graphs
- A new arithmetic criterion for graphs being determined by their generalized \(Q\)-spectrum
- A new method for constructing graphs determined by their generalized spectrum
- Per-spectral characterizations of graphs with extremal per-nullity
- Distinguishing graphs with zeta functions and generalized spectra
- On the spectral characterizations of graphs
- Laplacian spectral characterization of (broken) dandelion graphs
- The signed graphs with all but at most three eigenvalues equal to \(-1\)
- Haemers’ Conjecture: An Algorithmic Perspective
- Applications of Estrada indices and energy to a family of compound graphs
- Graphs with at most one generalized cospectral mate
- Laplacian spectral characterization of dumbbell graphs and theta graphs
- On the spectral characterization of the union of complete multipartite graph and some isolated vertices
- Characterizing the mixed graphs with exactly one positive eigenvalue and its application to mixed graphs determined by their \(H\)-spectra
- Characterizing properties of permanental polynomials of lollipop graphs
- Some degree sequences are determined by Laplacian spectra of the corresponding graphs
- Generalized spectral characterization of mixed graphs
- Polynomial characterizations of distance-biregular graphs
- Cospectral graphs and the generalized adjacency matrix
- A note on graphs with purely imaginary per-spectrum
- A note on the spectral characterization of dumbbell graphs
- The complements of path and cycle are determined by their distance (signless) Laplacian spectra
- Majorization, degree sequence and \(A_\alpha\)-spectral characterization of graphs
- A study of graph spectra for comparing graphs and trees
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- Universal adjacency spectrum of the cozero-divisor graph and its complement on a finite commutative ring with unity
- Quantum and non-signalling graph isomorphisms
- Singularity of Hermitian (quasi-)Laplacian matrix of mixed graphs
- Developments on spectral characterizations of graphs
- Statistical Analysis of Random Objects Via Metric Measure Laplacians
- Generalized spectral characterizations of a new family of noncontrollable graphs
- scientific article; zbMATH DE number 6679418 (Why is no real title available?)
- The Q-minimizer graph with given independence number
- Some results on the bounds of signless Laplacian eigenvalues
- Two spectral characterizations of regular, bipartite graphs with five eigenvalues
- Merging the \(A\)- and \(Q\)-spectral theories
- Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
- Mixed graphs determined by their generalized Hermitian adjacency spectrum based on Eisenstein integers
- The kite graph is determined by its adjacency spectrum
- Sharp bounds on the signless Laplacian spectral radii of graphs
- Graphs whose \(A_\alpha \) -spectral radius does not exceed 2
- Spectral characterizations of lollipop graphs
- On the non-existence of antipodal cages of even girth
- Some algebraic properties of a class of integral graphs determined by their spectrum
- On a Laplacian spectral characterization of graphs of index less than 2
- On the spectral characterization of kite graphs
- A note on the spectral characterization of \(\theta \)-graphs
- Some bounds on the largest eigenvalues of graphs
- Bounds for the incidence \(\mathcal{Q}\)-spectral radius of uniform hypergraphs
- Cospectral constructions for several graph matrices using cousin vertices
This page was built for publication: Which graphs are determined by their spectrum?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1414143)
