Constructing cospectral graphs

Cites work

Almost All Steiner Triple Systems Are Asymmetric
scientific article; zbMATH DE number 3503313 (Why is no real title available?)
scientific article; zbMATH DE number 3627232 (Why is no real title available?)
scientific article; zbMATH DE number 3296351 (Why is no real title available?)
scientific article; zbMATH DE number 3324507 (Why is no real title available?)
Neighbourhoods of transitive graphs and GRR's
On the stability of the equilibrium positions for discontinuous systems

Cited in

(only showing first 100 items - show all)

Developments on spectral characterizations of graphs
The lollipop graph is determined by its Q-spectrum
Spectral characterizations of sandglass graphs
Partitioned tensor products and their spectra
Which graphs are determined by their spectrum?
Families of integral trees with diameters 4, 6, and 8.
Enumeration of cospectral graphs.
On graphs with three eigenvalues
Construction of integral graphs
Spectral characterizations of some distance-regular graphs
No threshold graphs are cospectral
Strongly regular graphs from classical generalized quadrangles
Unification of graph products and compatibility with switching
Cospectral mates for the union of some classes in the Johnson association scheme
Switched graphs of some strongly regular graphs related to the symplectic graph
Complementarity eigenvalue analysis of connected graphs
Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
Equitable switching and spectra of graphs
Distance-regularity and the spectrum of graphs
The characteristic polynomials of modified graphs
Enumeration of graphs with the same Ihara zeta function
Cospectrality preserving graph modifications and eigenvector properties via walk equivalence of vertices
Spectra of \(M\)-edge rooted product of graphs
The smallest pair of cospectral cubic graphs with different chromatic indexes
Constructing cospectral graphs via regular rational orthogonal matrices with level two
On the construction of cospectral nonisomorphic bipartite graphs
On Hosoya's dormants and sprouts
On cospectrality of gain graphs
Switching for 2-designs
Bigalois extensions and the graph isomorphism game
Zeta-equivalent digraphs: simultaneous cospectrality
Construction of cospectral graphs
Joins of hypergraphs and their spectra
On a theorem of Godsil and McKay concerning the construction of cospectral graphs
On NP-hard graph properties characterized by the spectrum
Godsil-McKay switching for mixed and gain graphs over the circle group
Cospectral constructions for several graph matrices using cousin vertices
Enumeration of cospectral and coinvariant graphs
New strongly regular graphs from finite geometries via switching
An iterative construction of isospectral digraphs
Cospectrality of graphs with respect to distance matrices
Cospectral bipartite graphs with the same degree sequences but with different number of large cycles
Cospectral pairs of regular graphs with different connectivity
Determining graphs by the complementary spectrum
Constructing non-isomorphic signless Laplacian cospectral graphs
Characterizing cospectral vertices via isospectral reduction
Distinguishing graphs with zeta functions and generalized spectra
Exponentially many graphs have a \(Q\)-cospectral mate
Construction of cospectral integral regular graphs
Godsil-McKay switching and twisted Grassmann graphs
Integral trees of diameter 6
Some results on the spectral reconstruction problem
Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
A switching for all strongly regular collinearity graphs from polar spaces
A construction of distance cospectral graphs
The line graphs of lollipop graphs are determined by their spectra
Main Q-eigenvalues and generalized Q-cospectrality of graphs
Integral trees with diameters 5 and 6
The normalized distance Laplacian
Spectral determinations and eccentricity matrix of graphs
Quantum walks defined by digraphs and generalized Hermitian adjacency matrices
Graphs with at most one generalized cospectral mate
Cospectral digraphs from locally line digraphs
Graphs whose characteristic and permanental polynomials have coefficients of the same magnitude
Spectral characterization of multicone graphs
Notes on simplicial rook graphs
Switched symplectic graphs and their 2-ranks
On the spectral characterization of pineapple graphs
A cospectral family of graphs for the normalized Laplacian found by toggling
Isospectral discrete and quantum graphs with the same flip counts and nodal counts
Graphs that are cospectral for the distance Laplacian
Construction of strongly regular graphs having an automorphism group of composite order
A simple arithmetic criterion for graphs being determined by their generalized spectra
A note about cospectral graphs for the adjacency and normalized Laplacian matrices
SPECTRUM BASED TECHNIQUES FOR GRAPH ISOMORPHISM
Two Laplacians for the distance matrix of a graph
E-cospectral hypergraphs and some hypergraphs determined by their spectra
Spectral characterizations of almost complete graphs
On the spectral characterization of some unicyclic graphs
On triple systems and strongly regular graphs
Constructing cospectral graphs via a new form of graph product
\(\mathcal Q\)-cospectrality and \(\mathcal L\)-energy in cographs
Developments in the theory of graph spectra
Cospectral regular graphs with and without a perfect matching
Graphs cospectral with distance-regular graphs
Constructing cospectral signed graphs
A unified framework for structured graph learning via spectral constraints
Constructing families of cospectral regular graphs
Spectra of \(M\)-rooted product of graphs
On the construction of cospectral graphs for the adjacency and the normalized Laplacian matrices
\(A_\alpha\) spectra of graphs obtained by two corona operations and \(A_\alpha\) cospectral graphs
Spectra of bowtie product of graphs
Random quantum graphs
Constructions of cospectral graphs with different zero forcing numbers
Constructing isospectral non-isomorphic digraphs from hypergraphs
A note on non-\(\mathbb{R}\)-cospectral graphs
Self-orthogonal codes from row orbit matrices of strongly regular graphs
Spectra of coronae
Edge switching transformations of quantum graphs: a scattering approach
Graphs determined by their \(T\)-gain spectra

This page was built for publication: Constructing cospectral graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q595685)