A strongly connected digraph D is one in which any vertex can be reached from any other vertex by a directed path.
若有向图D中任何两个顶点是互相可达的，则称D为强连通图。
In this paper, we show that under the condition that the minimum degree is at least 3, the iterated line digraph of a super-arc-connected digraph is super-connected.
本文证明了，在最小度至少为3的前提下超弧连通有向图的迭代线图是超点连通的。
In this paper, we show that under the condition that the minimum degree is at least 3, the iterated line digraph of a super-arc-connected digraph is super-connected.
本文证明了，在最小度至少为3的前提下超弧连通有向图的迭代线图是超点连通的。
应用推荐