Maximal digraphs whose Hermitian spectral radius is at most 2

2021/09/19 by Alexander L. Gavrilyuk, Gavrilyuk, Alexander L., Akihiro Munemasa +1
Mathematics · Chemistry · #Graph theory and applications #Synthesis and Properties of Aromatic Compounds #Finite Group Theory Research

paper · pdf · doi:10.48550/arxiv.2109.09114

Abstract

We classify maximal digraphs whose Hermitian spectral radius is at most 2.

Related

• The maximal spectral radius of a digraph with (m+1)² - s edges
• On spectral radius of strongly connected digraphs
• On the spectral radius of simple digraphs with prescribed number of arcs
• Some α-spectral extremal results for some digraphs
• A spectral extremal problem on graphs with given size and matching number