Bipartite graphs with at most six non-zero eigenvalues
From MaRDI portal
Publication:2958699
Cited in
(21)- Adjacency eigenvalues of graphs without short odd cycles
- Eigenvalues and triangles in graphs
- LOWER BOUNDS FOR ENERGY OF MATRICES AND ENERGY OF REGULAR GRAPHS
- Spectral characterization of mixed extensions of small graphs
- On the third largest eigenvalue of graphs
- Triangle-free graphs with six non-zero eigenvalues
- On the Seidel Estrada index of graphs
- Majorization and the spectral radius of starlike trees
- A new lower bound for the energy of graphs
- On ABC Estrada index of graphs
- A complete characterization of graphs with exactly two positive eigenvalues
- Distance spectral radius of complete multipartite graphs and majorization
- The number of spanning trees in \(K_n\)-complement of a bipartite graph
- New type bounds for energy of graphs and spread of matrices
- On the eigenvalues and spectral radius of starlike trees
- On graphs with girth \(g\) and positive inertia index of \(\frac{\lceil g\rceil}{2}-1\) and \(\frac{\lceil g\rceil}{2}\)
- On graphs with exactly two positive eigenvalues
- scientific article; zbMATH DE number 11798 (Why is no real title available?)
- Energy of graphs with no eigenvalue in the interval \((-1,1)\)
- A necessary and sufficient eigenvector condition for a connected graph to be bipartite
- A relation between the signless Laplacian spectral radius of complete multipartite graphs and majorization
This page was built for publication: Bipartite graphs with at most six non-zero eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958699)
