On the first eigenvalue of bipartite graphs

From MaRDI portal
Publication:1010881

zbMath1178.05061arXiv0809.1615MaRDI QIDQ1010881

Amitava Bhattacharya, Uri N. Peled, Shmuel Friedland

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0809.1615




Related Items (40)

Combinatorial methods for the spectral \(p\)-norm of hypermatricesEigenvalue location for chain graphsGeneralizing theorems of Nosal and Nikiforov: triangles and quadrilateralsSome new sufficient conditions for 2p-Hamilton-biconnectedness of graphsSome generalizations of spectral conditions for 2s-hamiltonicity and 2s-traceability of bipartite graphsMinimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\))Counterexamples of the Bhattacharya-Friedland-Peled conjectureSome Properties of Chain and Threshold GraphsConnected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex caseMinimizing the least eigenvalue of graphs with fixed order and sizeSpectral radius and Hamiltonian properties of graphs, IISufficient spectral conditions on Hamiltonian and traceable graphsSpectral extremal results with forbidding linear forestsA note on connected bipartite graphs of fixed order and size with maximal indexSome new considerations about double nested graphsMaximize the \(Q\)-index of graphs with fixed order and sizeSpectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphsOn graphs whose third largest distance eigenvalue dose not exceed \(-1\)Distance between the spectra of certain graphsAn extending result on spectral radius of bipartite graphsOn the spectral invariants of symmetric matrices with applications in the spectral graph theorySome spectral inequalities for connected bipartite graphs with maximum \(A_\alpha\)-indexSpectral conditions and Hamiltonicity of a balanced bipartite graph with large minimum degreeSpectral radius and Hamiltonicity of graphsFurther results on the least eigenvalue of connected graphsConnected graphs with maximal \(Q\)-index: The one-dominating-vertex caseOn bounds for the index of double nested graphsOn the Laplacian spectral radius of bipartite graphs with fixed order and sizeMaximum spectral radius of graphs with given connectivity, minimum degree and independence numberA note on spectral radius and degree deviation in graphsSpectral radius and traceability of graphs with large minimum degreeOn main eigenvalues of chain graphsOn the N-spectrum of oriented graphsThe maximum spectral radius of irregular bipartite graphsVertex types in threshold and chain graphsOn the largest eigenvalues of bipartite graphs which are nearly completeFast algorithms for computing the characteristic polynomial of threshold and chain graphsSpectral radius of bipartite graphsNon-bipartite graphs of fixed order and size that minimize the least eigenvalueAn extremal problem on Q-spectral radii of graphs with given size and matching number




This page was built for publication: On the first eigenvalue of bipartite graphs