Cospectrality of complete bipartite graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(21)- When can the components of NEPS of connected bipartite graphs be almost cospectral?
- On the eigenvalues and spectral radius of starlike trees
- A relation between the signless Laplacian spectral radius of complete multipartite graphs and majorization
- Distance between the spectra of certain graphs
- A new lower bound for the energy of graphs
- Distance spectral radius of complete multipartite graphs and majorization
- Cospectrality of graphs
- On the third largest eigenvalue of graphs
- Distance between spectra of graphs
- Proof of a conjecture on spectral distance between cycles, paths and certain trees
- On the spectrum of some signed complete and complete bipartite graphs
- Cospectrality of multipartite graphs
- Cospectrality measures of graphs with at most six vertices
- Strong Cospectrality and Twin Vertices in Weighted Graphs
- LOWER BOUNDS FOR ENERGY OF MATRICES AND ENERGY OF REGULAR GRAPHS
- Energy of graphs with no eigenvalue in the interval \((-1,1)\)
- Reverse Wiener spectral radius of trees
- Complete (2,2) Bipartite Graphs
- New type bounds for energy of graphs and spread of matrices
- Majorization and the spectral radius of starlike trees
- Seidel energy of complete multipartite graphs
This page was built for publication: Cospectrality of complete bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953398)