Constructing cospectral graphs
From MaRDI portal
Publication:595685
DOI10.1007/BF02189621zbMATH Open0527.05051MaRDI QIDQ595685FDOQ595685
Brendan D. McKay, Chris Godsil
Publication date: 1982
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/136969
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Neighbourhoods of transitive graphs and GRR's
- On the stability of the equilibrium positions for discontinuous systems
- Almost All Steiner Triple Systems Are Asymmetric
Cited In (only showing first 100 items - show all)
- Spectral characterizations of sandglass graphs
- Main Q-eigenvalues and generalized Q-cospectrality of graphs
- Graphs that are cospectral for the distance Laplacian
- E-cospectral hypergraphs and some hypergraphs determined by their spectra
- Switching codes and designs
- Constructions of isospectral circulant graphs
- Construction of strongly regular graphs having an automorphism group of composite order
- 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
- Distinguishing graphs with zeta functions and generalized spectra
- On the spectral characterization of some unicyclic graphs
- On triple systems and strongly regular graphs
- Cospectral digraphs from locally line digraphs
- A study of graph spectra for comparing graphs and trees
- Developments on spectral characterizations of graphs
- Switching for 2-designs
- Graphs whose characteristic and permanental polynomials have coefficients of the same magnitude
- Spectral characterizations of some distance-regular graphs
- Spectral characterizations of lollipop graphs
- Cospectral regular graphs with and without a perfect matching
- Which graphs are determined by their spectrum?
- Enumeration of cospectral graphs.
- Distance-regularity and the spectrum of graphs
- Some results on overgraphs of a strongly regular graph
- On NP-hard graph properties characterized by the spectrum
- Notes on simplicial rook graphs
- 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
- Laplacian eigenvalues of equivalent cographs
- Random quantum graphs
- Characterizing distance-regularity of graphs by the spectrum
- GRAPHS DETERMINED BY THEIR -GAIN SPECTRA
- Quantum walks defined by digraphs and generalized Hermitian adjacency matrices
- Construction of integral graphs
- The line graphs of lollipop graphs are determined by their spectra
- On graphs with three eigenvalues
- The lollipop graph is determined by its \(Q\)-spectrum
- Partitioned tensor products and their spectra
- Spectral classes of regular, random, and empirical graphs
- A Unified Framework for Structured Graph Learning via Spectral Constraints
- The characteristic polynomials of modified graphs
- Graphs determined by their generalized characteristic polynomials
- Equitable switching and spectra of graphs
- Godsil-McKay switching and twisted Grassmann graphs
- Spectra of digraphs
- Spectra of coronae
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
- A simple arithmetic criterion for graphs being determined by their generalized spectra
- Cospectral pairs of regular graphs with different connectivity
- Construction of cospectral integral regular graphs
- Graphs cospectral with distance-regular graphs
- Strongly regular graphs from classical generalized quadrangles
- Constructing cospectral bipartite graphs
- Some results on the spectral reconstruction problem
- Determining graphs by the complementary spectrum
- Characterizing cospectral vertices via isospectral reduction
- Developments in the theory of graph spectra
- Integral trees of diameter 6
- Integral trees with diameters 5 and 6
- A note about cospectral graphs for the adjacency and normalized Laplacian matrices
- The overgraphs of generalized cospectral controllable graphs
- A note on non-\(\mathbb{R}\)-cospectral graphs
- Clique-inserted-graphs and spectral dynamics of clique-inserting
- Enumeration of graphs with the same Ihara zeta function
- New strongly regular graphs from finite geometries via switching
- The spectrum and metric dimension of Indu–Bala product of graphs
- Constructing isospectral non‐isomorphic digraphs from hypergraphs
- Graphs with at most one generalized cospectral mate
- Joins of hypergraphs and their spectra
- A note on graphs with purely imaginary per-spectrum
- Finding singularly cospectral graphs
- Cospectral constructions for several graph matrices using cousin vertices
- An explicit formula for the distance characteristic polynomial of threshold graphs
- Godsil-McKay switching for mixed and gain graphs over the circle group
- No threshold graphs are cospectral
- Constructing cospectral signed graphs
- Switching for Small Strongly Regular Graphs
- Spectra of M-rooted product of graphs
- Constructing non-isomorphic signless Laplacian cospectral graphs
- Title not available (Why is that?)
- Constructing cospectral graphs via a new form of graph product
- 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
- Constructing families of cospectral regular graphs
- Cospectrality preserving graph modifications and eigenvector properties via walk equivalence of vertices
- Constructing cospectral graphs by unfolding non-bipartite graphs
- Constructions of cospectral graphs with different zero forcing numbers
- Integral trees with diameter 6
- Isospectral discrete and quantum graphs with the same flip counts and nodal counts
- Spectra of bowtie product of graphs
- Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
- Construction of cospectral graphs
- On Hosoya's dormants and sprouts
- On cospectrality of gain graphs
- Exponentially many graphs have a \(Q\)-cospectral mate
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)