The following pages link to Constructing cospectral graphs (Q595685):
Displaying 50 items.
- Main Q-eigenvalues and generalized Q-cospectrality of graphs (Q254748) (← links)
- Cospectral digraphs from locally line digraphs (Q272341) (← links)
- Graphs whose characteristic and permanental polynomials have coefficients of the same magnitude (Q284749) (← links)
- Notes on simplicial rook graphs (Q295823) (← links)
- Switched symplectic graphs and their 2-ranks (Q306047) (← links)
- On the spectral characterization of pineapple graphs (Q306453) (← links)
- A cospectral family of graphs for the normalized Laplacian found by toggling (Q306482) (← links)
- A simple arithmetic criterion for graphs being determined by their generalized spectra (Q345094) (← links)
- Two Laplacians for the distance matrix of a graph (Q389586) (← links)
- E-cospectral hypergraphs and some hypergraphs determined by their spectra (Q401202) (← links)
- Spectral characterizations of almost complete graphs (Q403557) (← links)
- On the spectral characterization of some unicyclic graphs (Q409334) (← links)
- On triple systems and strongly regular graphs (Q439052) (← links)
- Cospectral regular graphs with and without a perfect matching (Q482228) (← links)
- A note on non-\(\mathbb{R}\)-cospectral graphs (Q521370) (← links)
- Spectra of coronae (Q551245) (← links)
- Graphs determined by their generalized characteristic polynomials (Q624543) (← links)
- Switching codes and designs (Q658111) (← links)
- The overgraphs of generalized cospectral controllable graphs (Q668064) (← links)
- Some results on overgraphs of a strongly regular graph (Q723422) (← links)
- Constructing cospectral bipartite graphs (Q785818) (← links)
- Constructions of isospectral circulant graphs (Q827535) (← links)
- Characterizing distance-regularity of graphs by the spectrum (Q855882) (← links)
- Spectral classes of regular, random, and empirical graphs (Q891525) (← links)
- Hermitian adjacency spectrum and switching equivalence of mixed graphs (Q891549) (← 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)
- Spectra of digraphs (Q962109) (← links)
- Developments on spectral characterizations of graphs (Q1011495) (← links)
- The lollipop graph is determined by its \(Q\)-spectrum (Q1025961) (← links)
- Spectral characterizations of sandglass graphs (Q1033076) (← 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)
- No threshold graphs are cospectral (Q1625488) (← links)
- Strongly regular graphs from classical generalized quadrangles (Q1675283) (← links)
- Unification of graph products and compatibility with switching (Q1684950) (← links)
- Cospectral mates for the union of some classes in the Johnson association scheme (Q1688881) (← links)
- Switched graphs of some strongly regular graphs related to the symplectic graph (Q1692159) (← links)
- Complementarity eigenvalue analysis of connected graphs (Q1698597) (← links)
- Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\) (Q1713301) (← 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)
- Enumeration of graphs with the same Ihara zeta function (Q1932629) (← links)