On the spectral radius of simple digraphs with prescribed number of arcs

2015/09/24 by Ya-Lei Jin, Xiao-Dong Zhang, Jin, Ya-Lei +2
Computer Science · Mathematics · #05C50 #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Matrix Theory and Algorithms #math.CO #msc:05C50

paper · pdf · doi:10.48550/arxiv.1509.07372

14 pages in Discrete Mathematics, 2015

arxiv created 2015/09/24 · openalex publication_date 2015/09/24 · arxiv updated 2015/09/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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=2k\choose 2+t and k>4t⁴+4.

Related

• Some α-spectral extremal results for some digraphs
• On spectral radius of strongly connected digraphs
• Ordering digraphs with maximum outdegrees by their A_α spectral radius
• Maximal digraphs whose Hermitian spectral radius is at most 2
• Extremal graphs for the maximum A_α-spectral radius of graphs with order and size