【摘要】 限制弧割是将有向连通图G分割成阶数至少为2的双向连通分支的弧割,有向图G的最小限制弧割的弧数称为图G的限制弧连通度.易见,一个有向图B_G(2,n)至少有4个顶点才有限制弧割.本文证明了:当n≥7时,二元有向图De Bruijn图是极大限制弧连通的.更多还原

【Abstract】 A restricted arc-cut is an arc-cut that divides a directed connected graph into bidirectional connected branches with a minimum order of 2.The minimum cardinality over all restricted arc-cuts of a digraph is called its restricted arc connectivity.Clearly,a directed graph must have at least 4 vertices to have a restricted arc cut.This paper shows that generalized binary De Bruijn digraph is maximally restricted arc connected if n≥ 7.更多还原