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)- Godsil-McKay switchings for gain graphs
- Switched graphs of some strongly regular graphs related to the symplectic graph
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
- A simple arithmetic criterion for graphs being determined by their generalized spectra
- Cospectral graphs obtained by edge deletion
- Cospectral pairs of regular graphs with different connectivity
- Construction of cospectral integral regular graphs
- Cospectral bipartite graphs with the same degree sequences but with different number of large cycles
- Annihilating polynomial, Jordan canonical form, and generalized spectral characterizations of Eulerian graphs
- Unification of graph products and compatibility with switching
- Spectral theory of the non-backtracking Laplacian for graphs
- Graphs determined by their \(T\)-gain spectra
- Counting cospectral graphs obtained via switching
- Complementarity eigenvalues and graph determination
- Spectra of \(M\)-rooted product of graphs
- SPECTRUM BASED TECHNIQUES FOR GRAPH ISOMORPHISM
- 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
- Some graph parameters of Indu-Bala product of graphs
- 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
- A cospectral construction for the generalized distance matrix
- Characterizing cospectral vertices via isospectral reduction
- Degree-similar graphs
- 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
- Constructing cospectral graphs via exotic graph products
- 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
- The graphs of pyramids are determined by their spectrum
- 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
- On the distance cospectrality of threshold 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 matrix with level two and three
- Constructing cospectral graphs via regular rational orthogonal matrices with level two
- High-ordered spectral characterization of unicyclic graphs
- Differentiate data by higher-order structures
- A unified framework for structured graph learning via spectral constraints
- Generating all regular rational orthogonal matrices
- Enumeration of graphs with the same Ihara zeta function
- Generalized spectral characterization of signed trees
- 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
- Constructing cospectral hypergraphs
- The spectrum and metric dimension of Indu–Bala product of graphs
- Cospectral digraphs from locally line digraphs
- Constructing cospectral graphs with irreducible characteristic polynomials
- 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
- Research problems from the 1st Chinese-Southeasteuropean conference on discrete mathematics and applications
- 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?
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)
