A strongly connecteddigraph D is one in which any vertex can be reached from any other vertex by a directed path.
若有向图D中任何两个顶点是互相可达的,则称D为强连通图。
2
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-connecteddigraph is super-connected.