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)- 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?
- 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
- Higher-order topology protected by latent crystalline symmetries
- 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
- High-order spectral characterizations of graphs
- On the construction of cospectral graphs for the adjacency and the normalized Laplacian matrices
- Spectral characterization of multicone graphs
- Constructing adjacency and distance cospectral graphs via regular rational orthogonal matrix
- 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
- The NEPS of gain graphs over arbitrary groups and its spectra
- 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
- On Hosoya's dormants and sprouts
- Construction of cospectral graphs
- On cospectrality of gain graphs
- Integral trees with diameter 6
- Spectra of bowtie product of graphs
- Exponentially many graphs have a \(Q\)-cospectral mate
- Enumeration of cospectral and coinvariant graphs
- On graphs with three eigenvalues
- Cospectrality of graphs with respect to distance matrices
- The line graphs of lollipop graphs are determined by their spectra
- The A_-eigenvalues of the generalized subdivision graph
- Cokernel statistics for walk matrices of directed and weighted random graphs
- The lollipop graph is determined by its Q-spectrum
- Partitioned tensor products and their spectra
- Spectral classes of regular, random, and empirical graphs
- Graphs determined by their generalized characteristic polynomials
- The characteristic polynomials of modified graphs
- Distance signless Laplacian spectra of graphs: a survey
- Equitable switching and spectra of graphs
- Switching for small strongly regular graphs
- Spectra of digraphs
- Godsil-McKay switching and twisted Grassmann graphs
- A switching method for constructing cospectral gain graphs
- Spectra of coronae
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)
