Using matrix theory, we present a sharp upper bound on the spectral radius of digraphs and strongly connected diagraphs.
Using matrix theory, we present a sharp upper bound on the spectral radius of digraphs and strongly connected diagraphs.
摘要利用矩阵理论，给出了简单有向图的谱半径可达上界和强连通有向图的谱半径上界。