Which graphs are determined by their spectrum? (Q1414143): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q5672672
@@ Property / cites work: Q5672672 / rank @@
+Normal rank
@@ Property / cites work @@
+A new 5‐arc‐transitive cubic graph
@@ Property / cites work: A new 5‐arc‐transitive cubic graph / rank @@
+Normal rank
@@ Property / cites work @@
+Strongly regular graphs, partial geometries and partially balanced designs
+Normal rank
@@ Property / cites work @@
+Almost all trees share a complete set of immanantal polynomials
+Normal rank
@@ Property / cites work @@
+Non-Sunada graphs
@@ Property / cites work: Non-Sunada graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The uniqueness of the strongly regular graph on 77 points
+Normal rank
@@ Property / cites work @@
+Q4877005
@@ Property / cites work: Q4877005 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992965
@@ Property / cites work: Q3992965 / rank @@
+Normal rank
@@ Property / cites work @@
+The Gewirtz graph: An exercise in the theory of graph spectra
+Normal rank
@@ Property / cites work @@
+Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph
+Normal rank
@@ Property / cites work @@
+Q3998725
@@ Property / cites work: Q3998725 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4105702
@@ Property / cites work: Q4105702 / rank @@
+Normal rank
@@ Property / cites work @@
+Strongly regular graphs having strongly regular subconstituents
+Normal rank
@@ Property / cites work @@
+Line graphs, root systems, and elliptic geometry
@@ Property / cites work: Line graphs, root systems, and elliptic geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Q3270191
@@ Property / cites work: Q3270191 / rank @@
+Normal rank
@@ Property / cites work @@
+Spektren endlicher Grafen
@@ Property / cites work: Spektren endlicher Grafen / rank @@
+Normal rank
@@ Property / cites work @@
+A computer-assisted proof of the uniqueness of the Perkel graph
+Normal rank
@@ Property / cites work @@
+Q5648382
@@ Property / cites work: Q5648382 / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing trees with given eigenvalues and angles
+Normal rank
@@ Property / cites work @@
+Q4327350
@@ Property / cites work: Q4327350 / rank @@
+Normal rank
@@ Property / cites work @@
+Regular graphs with four eigenvalues
@@ Property / cites work: Regular graphs with four eigenvalues / rank @@
+Normal rank
@@ Property / cites work @@
+Nonregular graphs with three eigenvalues
@@ Property / cites work: Nonregular graphs with three eigenvalues / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with constant \(\mu\) and \(\overline{\mu}\)
+Normal rank
@@ Property / cites work @@
+Spectral characterizations of some distance-regular graphs
+Normal rank
@@ Property / cites work @@
+Small regular graphs with four eigenvalues
@@ Property / cites work: Small regular graphs with four eigenvalues / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial designs with two singular values. I: Uniform multiplicative designs
+Normal rank
@@ Property / cites work @@
+Q3958498
@@ Property / cites work: Q3958498 / rank @@
+Normal rank
@@ Property / cites work @@
+The complement of the path is determined by its spectrum
+Normal rank
@@ Property / cites work @@
+From local adjacency polynomials to locally pseudo-distance-regular graphs
+Normal rank
@@ Property / cites work @@
+On hearing the shape of a drum
@@ Property / cites work: On hearing the shape of a drum / rank @@
+Normal rank
@@ Property / cites work @@
+Isospectral graphs and isoperimetric constants
@@ Property / cites work: Isospectral graphs and isoperimetric constants / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with Maximal Even Girth
@@ Property / cites work: Graphs with Maximal Even Girth / rank @@
+Normal rank
@@ Property / cites work @@
+Q3137758
@@ Property / cites work: Q3137758 / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotic enumeration of Latin rectangles
@@ Property / cites work: Asymptotic enumeration of Latin rectangles / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing cospectral graphs
@@ Property / cites work: Constructing cospectral graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The regular two-graph on 276 vertices
@@ Property / cites work: The regular two-graph on 276 vertices / rank @@
+Normal rank
@@ Property / cites work @@
+Distance-regularity and the spectrum of graphs
@@ Property / cites work: Distance-regularity and the spectrum of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs cospectral with distance-regular graphs
@@ Property / cites work: Graphs cospectral with distance-regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Enumeration of cospectral graphs.
@@ Property / cites work: Enumeration of cospectral graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Generation of isospectral graphs
@@ Property / cites work: Generation of isospectral graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstruction of weighted graphs by their spectrum
+Normal rank
@@ Property / cites work @@
+On the Polynomial of a Graph
@@ Property / cites work: On the Polynomial of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Spectral characterization of some generalized odd graphs
+Normal rank
@@ Property / cites work @@
+A note on cospectral graphs
@@ Property / cites work: A note on cospectral graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Can One Hear the Shape of a Drum?
@@ Property / cites work: Can One Hear the Shape of a Drum? / rank @@
+Normal rank
@@ Property / cites work @@
+No starlike trees are cospectral
@@ Property / cites work: No starlike trees are cospectral / rank @@
+Normal rank
@@ Property / cites work @@
+Q5513521
@@ Property / cites work: Q5513521 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4841310
@@ Property / cites work: Q4841310 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4189313
@@ Property / cites work: Q4189313 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2760451
@@ Property / cites work: Q2760451 / rank @@
+Normal rank
@@ Property / cites work @@
+Large families of laplacian isospectral graphs
@@ Property / cites work: Large families of laplacian isospectral graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3344217
@@ Property / cites work: Q3344217 / rank @@
+Normal rank
@@ Property / cites work @@
+The characteristic polynomials of modified graphs
@@ Property / cites work: The characteristic polynomials of modified graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5545849
@@ Property / cites work: Q5545849 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5676231
@@ Property / cites work: Q5676231 / rank @@
+Normal rank
@@ Property / cites work @@
+Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
+Normal rank
@@ Property / cites work @@
+Q4065580
@@ Property / cites work: Q4065580 / rank @@
+Normal rank
@@ Property / cites work @@
+Large families of cospectral graphs
@@ Property / cites work: Large families of cospectral graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Uniqueness of the $\mathrm{L}_2$ Association Scheme
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0024-3795(03)00483-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2171567099
@@ Property / OpenAlex ID: W2171567099 / rank @@
+Normal rank