• Mathematics
  • Published 2016

λ′最优定向图的最小度条件 Minimum degree conditions for oriented graphs being λ′-optimal 云南民族大学学报:自然科学版,2016,25(3):225-229

@inproceedings{Lsw2016MD,
  title={λ′最优定向图的最小度条件 Minimum degree conditions for oriented graphs being λ′-optimal 云南民族大学学报:自然科学版,2016,25(3):225-229},
  author={林上为 Lsw},
  year={2016}
}
图的限制弧连通度是度量网络可靠性的一个重要指标.称强连通有向图D的弧割S是一个限制弧割,若D-S包含一个非平凡的强连通分支D′使得D-V(D′)包含至少一条弧.限制弧连通度λ′(D)是指最小限制弧割的弧数.λ′最优有向图是使限制弧连通度尽可能大的一类有向图.定向图是一类重要的有向图.定向图和多部定向图是λ′最优的一些最小度条件将被给出.这些结果推广了Gruter等关于竞赛图的相关结论. The restricted arc connectivity of a digraph is an important measurement for the reliability of a network. Let D be a digraph. An arc cut is a restricted arc cut of D if D-S has a nontrivial strong component D′ so that D-V(D′) contains an arc. The restricted arc connectivity λ′(D) is the… CONTINUE READING