Fang Kun-fu, Jinlong Shu
Abstract
Using matrix theory, we present a sharp upper bound on the spectral radius of digraphs in terms of the out-degree sequence. Meanwhile, we characterize the extremal digraphs which spectral radius reaches the upper bound.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Using matrix theory, we present a sharp upper bound on the spectral radius of digraphs in terms of the out-degree sequence. Meanwhile, we characterize the extremal digraphs which spectral radius reaches the upper bound.
Key concepts: Spectral radius, Upper and lower bounds, RADIUS, Mathematics, Combinatorics, Matrix (chemical analysis), Sequence (biology), Physics