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 e=2kchoose2+t and k>4t4+4.












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)