The following pages link to Constructing cospectral graphs (Q595685):
Displayed 19 items.
- Characterizing distance-regularity of graphs by the spectrum (Q855882) (← links)
- Spectral characterizations of lollipop graphs (Q924315) (← links)
- A study of graph spectra for comparing graphs and trees (Q937426) (← links)
- Clique-inserted-graphs and spectral dynamics of clique-inserting (Q953479) (← links)
- Partitioned tensor products and their spectra (Q1361461) (← links)
- Which graphs are determined by their spectrum? (Q1414143) (← links)
- Families of integral trees with diameters 4, 6, and 8. (Q1427190) (← links)
- Enumeration of cospectral graphs. (Q1427969) (← links)
- On graphs with three eigenvalues (Q1584351) (← links)
- Construction of integral graphs (Q1589798) (← links)
- Spectral characterizations of some distance-regular graphs (Q1597526) (← links)
- Equitable switching and spectra of graphs (Q1864966) (← links)
- Distance-regularity and the spectrum of graphs (Q1911436) (← links)
- The characteristic polynomials of modified graphs (Q1917341) (← links)
- Integral trees of diameter 6 (Q2370424) (← links)
- Some results on the spectral reconstruction problem (Q2383024) (← links)
- Integral trees with diameters 5 and 6 (Q2566149) (← links)
- Developments in the theory of graph spectra (Q4723771) (← links)
- Graphs cospectral with distance-regular graphs (Q4853928) (← links)