强连通有向图 meaning in Chinese
strongly connected digraph
strongly-connected digraph
Examples
- It is proved that seymour ' s second out - degree conjecture holds if and only if it holds for strong connected digraphs
证明了seymour二出度猜想成立等价于该猜想在强连通有向图上成立。 - Using matrix theory , we present a sharp upper bound on the spectral radius of digraphs and strongly connected diagraphs
摘要利用矩阵理论，给出了简单有向图的谱半径可达上界和强连通有向图的谱半径上界。