Constructing cospectral graphs
From MaRDI portal
Publication:595685
DOI10.1007/BF02189621zbMath0527.05051MaRDI QIDQ595685
Brendan D. McKay, Chris D. Godsil
Publication date: 1982
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/136969
Related Items (only showing first 100 items - show all)
Exponentially many graphs have a \(Q\)-cospectral mate ⋮ Cospectral digraphs from locally line digraphs ⋮ Construction of cospectral integral regular graphs ⋮ Godsil-McKay switching and twisted Grassmann graphs ⋮ Constructions of isospectral circulant graphs ⋮ Graphs whose characteristic and permanental polynomials have coefficients of the same magnitude ⋮ No threshold graphs are cospectral ⋮ Integral trees of diameter 6 ⋮ Notes on simplicial rook graphs ⋮ Spectral characterization of multicone 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 ⋮ On the construction of cospectral nonisomorphic bipartite graphs ⋮ On Hosoya's dormants and sprouts ⋮ Some results on the spectral reconstruction problem ⋮ On cospectrality of gain graphs ⋮ Switching for 2-designs ⋮ Characterizing distance-regularity of graphs by the spectrum ⋮ Partitioned tensor products and their spectra ⋮ A simple arithmetic criterion for graphs being determined by their generalized spectra ⋮ Distance-regularity and the spectrum of graphs ⋮ Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths ⋮ The characteristic polynomials of modified graphs ⋮ The normalized distance Laplacian ⋮ A switching for all strongly regular collinearity graphs from polar spaces ⋮ A construction of distance cospectral graphs ⋮ Strongly regular graphs from classical generalized quadrangles ⋮ Constructing cospectral graphs via a new form of graph product ⋮ Bigalois extensions and the graph isomorphism game ⋮ Two Laplacians for the distance matrix of a graph ⋮ Spectral determinations and eccentricity matrix of graphs ⋮ Zeta-equivalent digraphs: simultaneous cospectrality ⋮ Unification of graph products and compatibility with switching ⋮ Enumeration of graphs with the same Ihara zeta function ⋮ Spectral classes of regular, random, and empirical 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 ⋮ Cospectral mates for the union of some classes in the Johnson association scheme ⋮ Graphs cospectral with distance-regular graphs ⋮ On the spectral characterization of some unicyclic graphs ⋮ Switched graphs of some strongly regular graphs related to the symplectic graph ⋮ Graphs determined by their generalized characteristic polynomials ⋮ Construction of cospectral graphs ⋮ Joins of hypergraphs and their spectra ⋮ On a theorem of Godsil and McKay concerning the construction of cospectral graphs ⋮ Quantum walks defined by digraphs and generalized Hermitian adjacency matrices ⋮ On NP-hard graph properties characterized by the spectrum ⋮ The line graphs of lollipop graphs are determined by their spectra ⋮ Complementarity eigenvalue analysis of connected graphs ⋮ Graphs with at most one generalized cospectral mate ⋮ On triple systems and strongly regular graphs ⋮ Which graphs are determined by their spectrum? ⋮ Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\) ⋮ Spectral characterizations of lollipop graphs ⋮ Families of integral trees with diameters 4, 6, and 8. ⋮ Enumeration of cospectral graphs. ⋮ Switching codes and designs ⋮ Cospectral regular graphs with and without a perfect matching ⋮ Godsil-McKay switching for mixed and gain graphs over the circle group ⋮ A study of graph spectra for comparing graphs and trees ⋮ The overgraphs of generalized cospectral controllable graphs ⋮ Cospectral constructions for several graph matrices using cousin vertices ⋮ -cospectrality and -energy in cographs ⋮ Enumeration of cospectral and coinvariant graphs ⋮ A note about cospectral graphs for the adjacency and normalized Laplacian matrices ⋮ Clique-inserted-graphs and spectral dynamics of clique-inserting ⋮ A note on non-\(\mathbb{R}\)-cospectral graphs ⋮ Spectra of digraphs ⋮ Spectra of coronae ⋮ New strongly regular graphs from finite geometries via switching ⋮ An iterative construction of isospectral digraphs ⋮ Cospectrality of graphs with respect to distance matrices ⋮ Some results on overgraphs of a strongly regular graph ⋮ Cospectrality preserving graph modifications and eigenvector properties via walk equivalence of vertices ⋮ 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 ⋮ Developments on spectral characterizations of graphs ⋮ SPECTRUM BASED TECHNIQUES FOR GRAPH ISOMORPHISM ⋮ Characterizing cospectral vertices via isospectral reduction ⋮ The lollipop graph is determined by its \(Q\)-spectrum ⋮ Spectra of \(M\)-edge rooted product of graphs ⋮ The smallest pair of cospectral cubic graphs with different chromatic indexes ⋮ Developments in the theory of graph spectra ⋮ Spectral characterizations of sandglass graphs ⋮ Integral trees with diameters 5 and 6 ⋮ Constructing cospectral bipartite graphs ⋮ On graphs with three eigenvalues ⋮ Constructing cospectral graphs via regular rational orthogonal matrices with level two ⋮ Construction of integral graphs ⋮ Spectral characterizations of some distance-regular graphs ⋮ Construction of strongly regular graphs having an automorphism group of composite order ⋮ Distinguishing graphs with zeta functions and generalized spectra ⋮ Equitable switching and spectra of graphs ⋮ Graphs that are cospectral for the distance Laplacian ⋮ Main Q-eigenvalues and generalized Q-cospectrality of graphs
Cites Work
This page was built for publication: Constructing cospectral graphs
