Bounds of eigenvalues of a nontrivial bipartite graph.

zbMATH Open1313.05230MaRDI QIDQ2936723FDOQ2936723

Authors: Hong-Jian Lai, Ju Zhou, Bolian Liu 

Publication date: 6 January 2015

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

zbMATH Keywords

eigenvalue of a graphnontrivial bipartite graph

Mathematics Subject Classification ID

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

Cited In (6)

• Unified spectral Hamiltonian results of balanced bipartite graphs and complementary graphs
• Bounds on the greatest eigenvalue of graphs.
• Bounds of eigenvalues of a graph
• Title not available (Why is that?)
• 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)