On the spectral radius of simple digraphs with prescribed number of arcs
From MaRDI portal
Publication:2344783
Abstract: This paper presents a sharp upper bound for the spectral radius of simple digraphs with described number of arcs. Further, the extremal graphs which attain the maximum spectral radius among all simple digraphs with fixed arcs are investigated. In particular, we characterize all extremal simple digraphs with the maximum spectral radius among all simple digraphs with arcs number and .
Recommendations
Cites work
- A bound on the spectral radius of matrices of zeros and ones
- Extremal digraphs with given clique number
- Inequalities: theory of majorization and its applications
- Matrix Analysis
- On the spectral radius of (0,1)-matrices
- Sharp bounds on the spectral radius of nonnegative matrices and digraphs
- Spectra of digraphs
- Spectral radius of digraphs with given dichromatic number
- Spectral radius of non-negative matrices and digraphs
- Spectral radius of strongly connected digraphs
- The maximal eigenvalue of 0-1 matrices with prescribed number of ones
- The maximal spectral radius of a digraph with (m+1)^2-s edges
- The maximum Perron roots of digraphs with some given parameters
Cited in
(8)- The eccentricity matrix of a digraph
- The \(A_\alpha\) spectral radius and maximum outdegree of irregular digraphs
- The (distance) signless Laplacian spectral radius of digraphs with given arc connectivity
- The maximum Perron roots of digraphs with some given parameters
- scientific article; zbMATH DE number 1156640 (Why is no real title available?)
- The maximal spectral radius of a digraph with (m+1)^2-s edges
- A matrix realization of spectral bounds
- Improved upper and lower bounds for the spectral radius of digraphs
This page was built for publication: On the spectral radius of simple digraphs with prescribed number of arcs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344783)