The following pages link to Generation of isospectral graphs (Q4256094):
Displaying 11 items.
- Two Laplacians for the distance matrix of a graph (Q389586) (← links)
- A large family of cospectral Cayley graphs over dihedral groups (Q512612) (← links)
- Which graphs are determined by their spectrum? (Q1414143) (← links)
- Reconstruction of weighted graphs by their spectrum (Q1580674) (← links)
- Construction of cospectral graphs (Q2196489) (← links)
- A large family of cospectral Cayley graphs over dicyclic groups (Q2231727) (← links)
- Cospectrality of graphs with respect to distance matrices (Q2279251) (← links)
- Three distance characteristic polynomials of some graphs (Q2451677) (← links)
- Stronger arithmetic equivalence (Q5028495) (← links)
- Some properties of the distance Laplacian eigenvalues of a graph (Q5496694) (← links)
- A geometric construction of isospectral magnetic graphs (Q6172799) (← links)
