The maximal eigenvalue of 0-1 matrices with prescribed number of ones
From MaRDI portal
Publication:1066234
DOI10.1016/0024-3795(85)90068-0zbMath0578.15010OpenAlexW1999229680MaRDI QIDQ1066234
Publication date: 1985
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(85)90068-0
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Positive matrices and their generalizations; cones of matrices (15B48) Matrices of integers (15B36)
Related Items
On the minimum spectral radius of matrices of zeros and ones, The greedy strategy for optimizing the Perron eigenvalue, On the \(A_\alpha \)-spectral radius of graphs with given size and diameter, Bounds on the spectral radius of graphs with e edges, On the maximal index of graphs with a prescribed number of edges, Connected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex case, Bounds on graph eigenvalues, Unnamed Item, On the maximal index of connected graphs, Maximize the \(Q\)-index of graphs with fixed order and size, Spectra of digraphs, Connected graphs of fixed order and size with maximal index: some spectral bounds, Some spectral inequalities for connected bipartite graphs with maximum \(A_\alpha\)-index, Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case, Spectral radius of \(\{0,1\}\)-tensor with prescribed number of ones, Turán's theorem implies Stanley's bound, On the inverse and the dual index of a tree, On the spectral radius of (0,1)-matrices, On the spectral radius of simple digraphs with prescribed number of arcs, An extremal problem on Q-spectral radii of graphs with given size and matching number, Some bounds on the Aα-index of connected graphs with fixed order and size, Limit eigenvalues of nonnegative matrices, Spectral simplex method
Cites Work
