On the spectral radius of bipartite graphs which are nearly complete

DOI10.1186/1029-242X-2013-121zbMath1280.05077OpenAlexW2171350173WikidataQ59293258 ScholiaQ59293258MaRDI QIDQ2636687

Ismail Naci Cangul, Ayşe Dilek Güngör, Ahmet Sinan Cevik, Kinkar Chandra Das

Publication date: 31 January 2014

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/1029-242x-2013-121

zbMATH Keywords

bipartite graphspectral radiusadjacency matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Unnamed Item ⋮ Connected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex case ⋮ Maximize the \(Q\)-index of graphs with fixed order and size

Cites Work

• Proof of conjecture involving the second largest signless Laplacian eigenvalue and the index of graphs
• Conjectures on index and algebraic connectivity of graphs
• Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs
• A sharp upper bound on the spectral radius of weighted graphs
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• On the largest eigenvalues of bipartite graphs which are nearly complete
• Bounds of eigenvalues of graphs
• Proof of conjectures on adjacency eigenvalues of graphs
• Some new bounds on the spectral radius of graphs
• On the spectral radius of graphs with cut vertices
• The largest eigenvalue of a graph: A survey

This page was built for publication: On the spectral radius of bipartite graphs which are nearly complete