Constructing cospectral graphs

Cites work

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?)
Almost All Steiner Triple Systems Are Asymmetric
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)

Spectra of \(M\)-edge rooted product of graphs
The smallest pair of cospectral cubic graphs with different chromatic indexes
Strongly regular graphs from classical generalized quadrangles
Graphs cospectral with distance-regular graphs
Constructing cospectral bipartite graphs
Cospectral mates for the union of some classes in the Johnson association scheme
Some results on the spectral reconstruction problem
On a theorem of Godsil and McKay concerning the construction of cospectral graphs
Distance Laplacian spectra of graphs: a survey
Zeta-equivalent digraphs: simultaneous cospectrality
An improved condition for a family of trees being determined by their generalized spectrum
Determining graphs by the complementary spectrum
Characterizing cospectral vertices via isospectral reduction
Complementarity eigenvalue analysis of connected graphs
Spectra of variants of distance matrices of graphs and digraphs: a survey
Developments in the theory of graph spectra
A switching for all strongly regular collinearity graphs from polar spaces
Integral trees of diameter 6
Bigalois extensions and the graph isomorphism game
The normalized distance Laplacian
Integral trees with diameters 5 and 6
Spectral determinations and eccentricity matrix of graphs
The overgraphs of generalized cospectral controllable graphs
A note about cospectral graphs for the adjacency and normalized Laplacian matrices
A note on non-\(\mathbb{R}\)-cospectral graphs
Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
A construction of distance cospectral graphs
Clique-inserted-graphs and spectral dynamics of clique-inserting
Cospectral mates for generalized Johnson and Grassmann graphs
An iterative construction of isospectral digraphs
Constructing cospectral graphs via regular rational orthogonal matrices with level two
Differentiate data by higher-order structures
A unified framework for structured graph learning via spectral constraints
Enumeration of graphs with the same Ihara zeta function
Spectral characterizations of sandglass graphs
On the construction of cospectral nonisomorphic bipartite graphs
Main Q-eigenvalues and generalized Q-cospectrality of graphs
The strongly regular twisted \(D_{5 , 5} ( q )\) graph
E-cospectral hypergraphs and some hypergraphs determined by their spectra
New strongly regular graphs from finite geometries via switching
Graphs that are cospectral for the distance Laplacian
Switching codes and designs
Constructions of isospectral circulant graphs
Families of integral trees with diameters 4, 6, and 8.
Two Laplacians for the distance matrix of a graph
Spectral characterizations of almost complete graphs
Construction of strongly regular graphs having an automorphism group of composite order
On the spectral characterization of some unicyclic graphs
On triple systems and strongly regular graphs
Distinguishing graphs with zeta functions and generalized spectra
The spectrum and metric dimension of Indu–Bala product of graphs
Cospectral digraphs from locally line digraphs
Graphs with at most one generalized cospectral mate
Joins of hypergraphs and their spectra
A note on graphs with purely imaginary per-spectrum
A study of graph spectra for comparing graphs and trees
Developments on spectral characterizations of graphs
Graphs whose characteristic and permanental polynomials have coefficients of the same magnitude
Switching for 2-designs
Spectral characterizations of some distance-regular graphs
Spectral characterizations of lollipop graphs
Finding singularly cospectral graphs
Cospectral constructions for several graph matrices using cousin vertices
Cospectral regular graphs with and without a perfect matching
Godsil-McKay switching for mixed and gain graphs over the circle group
No threshold graphs are cospectral
An explicit formula for the distance characteristic polynomial of threshold graphs
\(A_\alpha\) spectra of graphs obtained by two corona operations and \(A_\alpha\) cospectral graphs
\(\mathcal Q\)-cospectrality and \(\mathcal L\)-energy in cographs
Edge switching transformations of quantum graphs: a scattering approach
Which graphs are determined by their spectrum?
Enumeration of cospectral graphs.
Distance-regularity and the spectrum of graphs
Constructing cospectral signed graphs
Some results on overgraphs of a strongly regular graph
Constructing non-isomorphic signless Laplacian cospectral graphs
Notes on simplicial rook graphs
Self-orthogonal codes from row orbit matrices of strongly regular graphs
On NP-hard graph properties characterized by the spectrum
Constructing cospectral graphs via a new form of graph product
On the construction of cospectral graphs for the adjacency and the normalized Laplacian matrices
Spectral characterization of multicone graphs
A cospectral family of graphs for the normalized Laplacian found by toggling
On the spectral characterization of pineapple graphs
Switched symplectic graphs and their 2-ranks
A geometric construction of isospectral magnetic graphs
On adjacency and Laplacian cospectral non-isomorphic signed graphs
Construction of cospectral graphs, signed graphs and \(\mathbb{T}\)-gain graphs via partial transpose
Cospectrality preserving graph modifications and eigenvector properties via walk equivalence of vertices
Constructing families of cospectral regular graphs
Characterizing distance-regularity of graphs by the spectrum
Laplacian eigenvalues of equivalent cographs
Random quantum graphs
Constructing cospectral graphs by unfolding non-bipartite graphs
Constructions of cospectral graphs with different zero forcing numbers
Construction of integral graphs
Isospectral discrete and quantum graphs with the same flip counts and nodal counts
Quantum walks defined by digraphs and generalized Hermitian adjacency matrices
Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
Constructing isospectral non-isomorphic digraphs from hypergraphs

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)