Bounds of eigenvalues of a nontrivial bipartite graph.

MaRDI QIDQ2936723zbMATH OpenFDO

Authors Hong-Jian Lai, Ju Zhou, Bolian Liu

Publication date 6 January 2015

zbMATH Keywords

eigenvalue of a graphnontrivial bipartite graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• Upper bounds for the largest eigenvalues of a bipartite graph
• On graphs whose second largest eigenvalue is less than 1
• Bounds of eigenvalues of a graph
• Sharp upper bounds on the second largest eigenvalues of connected graphs
• scientific article; zbMATH DE number 810358

Cited in

(9)

• A note on median eigenvalues of bipartite graphs
• Upper bounds for the largest eigenvalues of a bipartite graph
• Sharp upper bounds on the second largest eigenvalues of connected graphs
• Unified spectral Hamiltonian results of balanced bipartite graphs and complementary graphs
• Bounds on the greatest eigenvalue of graphs.
• Bounds of eigenvalues of a graph
• scientific article; zbMATH DE number 7404405 (Why is no real title available?)
• A necessary and sufficient eigenvector condition for a connected graph to be bipartite
• Eigenvalue bounds for some classes of matrices associated with graphs

This page was built for publication: Bounds of eigenvalues of a nontrivial bipartite graph.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936723)