On the spectral radius of (0,1)-matrices
From MaRDI portal
Publication:1057342
DOI10.1016/0024-3795(85)90092-8zbMATH Open0563.15012OpenAlexW2016493597MaRDI QIDQ1057342
Richard A. Brualdi, Alan J. Hoffman
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)90092-8
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Matrices of integers (15B36)
Cites Work
Cited In (only showing first 100 items - show all)
- Some extremal problems concerning the square of a (0,1)-matrix
- Spectral simplex method
- Unoriented Laplacian maximizing graphs are degree maximal
- Maximizing spectral radii of uniform hypergraphs with few edges
- On the spectrum of threshold graphs
- Spectral radius of uniform hypergraphs
- A new upper bound for the spectral radius of graphs with girth at least 5
- On the energy of \((0, 1)\)-matrices
- The majorization theorem of extremal pseudographs
- The signless Laplacian spectral radius of graphs with a prescribed number of edges
- Some notes on the threshold graphs
- An extremal problem on Q-spectral radii of graphs with given size and matching number
- On a conjecture of V. Nikiforov
- Graphs of fixed order and size with maximal \(A_\alpha\)-index
- Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case
- Bounds on graph eigenvalues
- Some upper bounds on the spectral radius of a graph
- On an upper bound of the spectral radius of graphs
- Connected graphs of fixed order and size with maximal index: some spectral bounds
- The maximal eigenvalue of 0-1 matrices with prescribed number of ones
- The new upper bounds on the spectral radius of weighted graphs
- Extremal graph characterization from the bounds of the spectral radius of weighted graphs
- Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices
- Spectral radius and degree sequence of a graph
- The majorization theorem of connected graphs
- The least eigenvalue of graphs with given connectivity
- Bounds on the spectral radius of graphs with e edges
- On the maximal index of connected graphs
- A sharp upper bound of the spectral radius of graphs
- A sharp upper bound on the spectral radius of weighted graphs
- Spectral radius of bipartite graphs
- Nestedness in networks: A theoretical model and some applications
- Sharp upper bounds on the \(Q\)-index of (minimally) 2-connected graphs with given size
- The majorization theorem for signless Laplacian spectral radii of connected graphs
- The largest eigenvalue of a graph: A survey
- Graphs with maximal signless Laplacian spectral radius
- Some new bounds on the spectral radius of graphs
- Extensions on spectral extrema of \(C_5/C_6\)-free graphs with given size
- Spectral radius of non-negative matrices and digraphs
- The least eigenvalue of graphs with cut edges
- A bound on the spectral radius of graphs
- On the stability and spectral radius of a finite set of matrices
- A bound on the spectral radius of graphs with \(e\) edges
- Bounds of eigenvalues of graphs
- Spectra of digraphs
- Bounds of eigenvalues of \(K_{3,3}\)-minor free graphs
- A note on the bounds for the spectral radius of graphs
- Maximizing the spectral radius of graphs with fixed minimum degree and edge connectivity
- On the minimum spectral radius of matrices of zeros and ones
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- On the maximal index of graphs with a prescribed number of edges
- On the spectral radii and the signless Laplacian spectral radii of c-cyclic graphs with fixed maximum degree
- On bounds for the index of double nested graphs
- The least eigenvalue of the complements of trees
- On the spectral radius of the product of matrix exponentials
- The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges
- Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size
- The least eigenvalue of a graph with cut vertices
- Sharp upper bounds of the spectral radius of a graph
- The signless Laplacian spectral radius of tricyclic graphs and trees with \(k\) pendant vertices
- On the spectral radius of minimally 2-(edge)-connected graphs with given size
- On the spectral radius of a matrix algebra
- The spectral radius of bicyclic graphs with prescribed degree sequences
- Bounds on eigenvalues and chromatic numbers
- On a poset of trees
- Sharp upper bounds on the spectral radius of graphs
- Adjacency eigenvalues of graphs without short odd cycles
- On the \(A_\alpha \)-spectral radius of graphs with given size and diameter
- An extending result on spectral radius of bipartite graphs
- A Brualdi-Hoffman-Turán problem on cycles
- Counterexamples of the Bhattacharya-Friedland-Peled conjecture
- On the \(\alpha\)-index of minimally 2-connected graphs with given order or size
- A bound on the spectral radius of hypergraphs with \(e\) edges
- The Spectrum and Fine Spectrum of q-Cesàro Matrices with 0 < q < 1 on c0
- A note on the signless Laplacian spectral ordering of graphs with given size
- Maxima of the \(Q\)-index of leaf-free graphs with given size
- Turán's theorem implies Stanley's bound
- Maxima of the Q ( L )-index of (minimally) 2-edge-connected graphs with given size
- A note on eigenvalues of signed graphs
- Eigenvalues of subgraphs of the cube
- ON THE SECOND LARGEST SPECTRAL RADIUS OF UNICYCLIC BIPARTITE GRAPHS
- Maximize the \(Q\)-index of graphs with fixed order and size
- On the spectral radius of graphs without a gem
- Spectral extrema of graphs with fixed size: forbidden triangles and pentagons
- Title not available (Why is that?)
- Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size
- On Hamiltonian graphs with maximal index
- On the \(\alpha\)-spectral radius of unicyclic and bicyclic graphs with a fixed diameter
- Eigenvalue bounds of the Kirchhoff Laplacian
- Some extremal problems on \(A_\alpha \)-spectral radius of graphs with given size
- Spectral radius of graphs forbidden \(C_7\) or \(C_6^\triangle \)
- Upper bounds of spectral radius of symmetric matrices and graphs
- Maxima of the \(Q\)-spectral radius of \(C_3 (C_4)\)-free graphs with given size and minimum degree \(\delta \geq 2\)
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
- Tricylic hamiltonian graphs with minimal index
- Maxima of the \(A_\alpha\)-spectral radius of graphs with given size and minimum degree \(\delta \ge 2\)
- Maxima of \(L\)-index and \(Q\)-index: graphs with given size and diameter
- Spectral radius of \(\{0,1\}\)-tensor with prescribed number of ones
- Vertex deletion on split graphs: beyond 4-hitting set
- A sharp upper bound on the spectral radius of \(C_5\)-free/\(C_6\)-free graphs with given size
This page was built for publication: On the spectral radius of (0,1)-matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1057342)