Which graphs are determined by their spectrum?

DOI10.1016/S0024-3795(03)00483-XzbMath1026.05079OpenAlexW2171567099WikidataQ56388809 ScholiaQ56388809MaRDI QIDQ1414143

Willem H. Haemers, van Dam, Edwin R.

Publication date: 19 November 2003

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0024-3795(03)00483-x

zbMATH Keywords

distance-regular graphseigenvaluescospectral graphsspectra of graphs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (only showing first 100 items - show all)

Spectral clustering of combinatorial fullerene isomers based on their facet graph structure ⋮ Hypercubes are determined by their distance spectra ⋮ The Laplacian and signless Laplacian spectrum of semi-Cayley graphs over abelian groups ⋮ A note on the graph's resolvent and the multifilar structure ⋮ Some graphs determined by their spectra ⋮ On a signless Laplacian spectral characterization of \(T\)-shape trees ⋮ Laplacian spectral characterization of some graph join ⋮ The spectral characterization of wind-wheel graphs ⋮ Extremal Halin graphs with respect to the signless Laplacian spectra ⋮ An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra ⋮ The \(T\)-shape tree is determined by its Laplacian spectrum ⋮ On regular graphs with four distinct eigenvalues ⋮ Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\) ⋮ The spectral characterization of butterfly-like graphs ⋮ A simple arithmetic criterion for graphs being determined by their generalized spectra ⋮ Starlike trees are determined by their Laplacian spectrum ⋮ Cospectral graphs and the generalized adjacency matrix ⋮ Signless Laplacians of finite graphs ⋮ Spectral determination of graphs whose components are paths and cycles ⋮ On the spectral characterization of the union of complete multipartite graph and some isolated vertices ⋮ Two Laplacians for the distance matrix of a graph ⋮ On the (signless) Laplacian spectral characterization of the line graphs of lollipop graphs ⋮ Spectral characterization of graphs whose second largest eigenvalue is less than 1 ⋮ Generalized spectral characterization of graphs revisited ⋮ Sharp bounds on the signless Laplacian spectral radii of graphs ⋮ Ihara zeta functions and cospectrality of joins of regular graphs ⋮ Hermitian adjacency spectrum and switching equivalence of mixed graphs ⋮ E-cospectral hypergraphs and some hypergraphs determined by their spectra ⋮ Spectral characterizations of almost complete graphs ⋮ On the spectral characterization of some unicyclic graphs ⋮ Laplacian spectrum characterization of extensions of vertices of wheel graphs and multi-fan graphs ⋮ Some properties of graphs determined by edge zeta functions ⋮ Graphs determined by their generalized characteristic polynomials ⋮ On the signless Laplacian index of cacti with a given number of pendant vertices ⋮ Numerical measures for two-graphs ⋮ Laplacian spectral characterization of some graphs obtained by product operation ⋮ Some bounds on the largest eigenvalues of graphs ⋮ The graphs with the least distance eigenvalue at least \(-\frac{1 + \sqrt{17}}{2}\) ⋮ The graph with spectrum \(14^{1} 2^{40}( - 4)^{10}( - 6)^{9}\) ⋮ The spectral characterization of \(\infty\)-graphs ⋮ The spectrum and the signless Laplacian spectrum of coronae ⋮ Laplacian spectral characterization of some graph products ⋮ Some results on the signless Laplacian spectra of unicyclic graphs ⋮ On the signless Laplacian index of unicyclic graphs with fixed diameter ⋮ Distinguishing graphs by their left and right homomorphism profiles ⋮ Graph clustering ⋮ An odd characterization of the generalized odd graphs ⋮ Spectral characterizations of lollipop graphs ⋮ Graphs whose certain polynomials have few distinct roots ⋮ Integral eigen-pair balanced classes of graphs with their ratio, asymptote, area, and involution-complementary aspects ⋮ Eigenvalues and energy in threshold graphs ⋮ On the signless Laplacian spectra of \(k\)-trees ⋮ Unoriented Laplacian maximizing graphs are degree maximal ⋮ Cospectral regular graphs with and without a perfect matching ⋮ The centipede is determined by its Laplacian spectrum ⋮ A study of graph spectra for comparing graphs and trees ⋮ Binary representations of regular graphs ⋮ Per-spectral characterizations of graphs with extremal per-nullity ⋮ Graphs with least eigenvalue \(-2\): ten years on ⋮ On the generalized spectral characterizations of Eulerian graphs ⋮ The overgraphs of generalized cospectral controllable graphs ⋮ The multi-fan graphs are determined by their Laplacian spectra ⋮ Per-spectral characterizations of bicyclic networks ⋮ On the spectra of simplicial rook graphs ⋮ Constructing graphs with given spectrum and the spectral radius at most 2 ⋮ Fractional virus epidemic model on financial networks ⋮ A remark on the generalized spectral characterization of the disjoint union of graphs ⋮ An application of Hoffman graphs for spectral characterizations of graphs ⋮ Maximizing the least signless Laplacian eigenvalue of unicyclic graphs ⋮ Graphs cospectral with starlike trees ⋮ A large family of cospectral Cayley graphs over dihedral groups ⋮ On a Laplacian spectral characterization of graphs of index less than 2 ⋮ A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph ⋮ Which \(Q\)-cospectral graphs have same degree sequences ⋮ The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\) ⋮ A note on non-\(\mathbb{R}\)-cospectral graphs ⋮ On graphs whose star sets are (co-)cliques ⋮ Graphs with integral spectrum ⋮ Mixed graphs with \(H\)-rank 3 ⋮ Spectra of digraphs ⋮ Towards a spectral theory of graphs based on the signless Laplacian. II. ⋮ Some spectral and quasi-spectral characterizations of distance-regular graphs ⋮ On integral graphs with few cycles ⋮ Bounds and conjectures for the signless Laplacian index of graphs ⋮ The cospectral equivalence classes of graphs having an isolated vertex ⋮ Universal adjacency matrices with two eigenvalues ⋮ Graphs whose normalized Laplacian has three eigenvalues ⋮ Two spectral characterizations of regular, bipartite graphs with five eigenvalues ⋮ Signless Laplacian spectral radii of graphs with given chromatic number ⋮ On the two largest \(Q\)-eigenvalues of graphs ⋮ The minimum signless Laplacian spectral radius of graphs with given independence number ⋮ Some results on the Laplacian spectrum ⋮ A note on the spectral characterization of dumbbell graphs ⋮ On determination of caterpillars with four terminal vertices by their Laplacian spectrum ⋮ Spectral characterizations of the corona of a cycle and two isolated vertices ⋮ On the construction of graphs determined by their generalized characteristic polynomials ⋮ Spectral characterization of the complete graph removing a path ⋮ Constructing cospectral bipartite graphs ⋮ Main Q-eigenvalues and generalized Q-cospectrality of graphs ⋮ Per-spectral and adjacency spectral characterizations of a complete graph removing six edges

Cites Work

• Constructing cospectral graphs
• Combinatorial designs with two singular values. I: Uniform multiplicative designs
• Spektren endlicher Grafen
• Constructing trees with given eigenvalues and angles
• A note on cospectral graphs
• Strongly regular graphs having strongly regular subconstituents
• Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph
• The regular two-graph on 276 vertices
• Line graphs, root systems, and elliptic geometry
• Nonregular graphs with three eigenvalues
• Non-Sunada graphs
• Spectral characterization of some generalized odd graphs
• The Gewirtz graph: An exercise in the theory of graph spectra
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Graphs with constant \(\mu\) and \(\overline{\mu}\)
• Enumeration of cospectral graphs.
• Reconstruction of weighted graphs by their spectrum
• Small regular graphs with four eigenvalues
• Spectral characterizations of some distance-regular graphs
• A computer-assisted proof of the uniqueness of the Perkel graph
• Isospectral graphs and isoperimetric constants
• The complement of the path is determined by its spectrum
• Regular graphs with four eigenvalues
• Distance-regularity and the spectrum of graphs
• The characteristic polynomials of modified graphs
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• Strongly regular graphs, partial geometries and partially balanced designs
• Almost all trees share a complete set of immanantal polynomials
• The Uniqueness of the $\mathrm{L}_2$ Association Scheme
• The uniqueness of the strongly regular graph on 77 points
• On the Polynomial of a Graph
• Generation of isospectral graphs
• Large families of laplacian isospectral graphs
• Graphs cospectral with distance-regular graphs
• Can One Hear the Shape of a Drum?
• On hearing the shape of a drum
• Graphs with Maximal Even Girth
• Asymptotic enumeration of Latin rectangles
• A new 5‐arc‐transitive cubic graph
• Large families of cospectral graphs
• No starlike trees are cospectral
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Which graphs are determined by their spectrum?