On the spectral radius of simple digraphs with prescribed number of arcs
From MaRDI portal
Publication:2344783
DOI10.1016/j.disc.2015.03.020zbMath1311.05075arXiv1509.07372OpenAlexW2037691728MaRDI QIDQ2344783
Publication date: 18 May 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.07372
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)
Related Items
The \(A_\alpha\) spectral radius and maximum outdegree of irregular digraphs, The (distance) signless Laplacian spectral radius of digraphs with given arc connectivity, The eccentricity matrix of a digraph
Cites Work
- The maximum Perron roots of digraphs with some given parameters
- A bound on the spectral radius of matrices of zeros and ones
- Spectra of digraphs
- On the spectral radius of (0,1)-matrices
- The maximal eigenvalue of 0-1 matrices with prescribed number of ones
- Spectral radius of strongly connected digraphs
- Spectral radius of non-negative matrices and digraphs
- Spectral radius of digraphs with given dichromatic number
- Sharp bounds on the spectral radius of nonnegative matrices and digraphs
- Extremal digraphs with given clique number
- Matrix Analysis
- The maximal spectral radius of a digraph with (m+1)^2-s edges
- Inequalities: theory of majorization and its applications