Generation of isospectral graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(24)- Which graphs are determined by their spectrum?
- Reconstruction of weighted graphs by their spectrum
- Construction of cospectral graphs
- A large family of cospectral Cayley graphs over dicyclic groups
- Cospectrality of graphs with respect to distance matrices
- Three distance characteristic polynomials of some graphs
- scientific article; zbMATH DE number 3917126 (Why is no real title available?)
- scientific article; zbMATH DE number 3968633 (Why is no real title available?)
- Two Laplacians for the distance matrix of a graph
- On Isospectral Graphs.
- scientific article; zbMATH DE number 1126815 (Why is no real title available?)
- scientific article; zbMATH DE number 7389754 (Why is no real title available?)
- Stronger arithmetic equivalence
- A large family of cospectral Cayley graphs over dihedral groups
- Some properties of the distance Laplacian eigenvalues of a graph.
- A geometric construction of isospectral magnetic graphs
- Isospectral graphs via inner symmetries
- Construction of cospectral graphs, signed graphs and \(\mathbb{T}\)-gain graphs via partial transpose
- Distance Laplacian spectra of graphs: a survey
- Distance signless Laplacian spectra of graphs: a survey
- Cokernel statistics for walk matrices of directed and weighted random graphs
- Constructing cospectral hypergraphs
- Quotients of graph operators by symmetry representations
- Linear representations and isospectrality with boundary conditions
This page was built for publication: Generation of isospectral graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4256094)