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

林上为 LSW

摘要


图的限制弧连通度是度量网络可靠性的一个重要指标.称强连通有向图D的弧割S是一个限制弧割,若D-S包含一个非平凡的强连通分支D′使得D-V(D′)包含至少一条弧.限制弧连通度λ′(D)是指最小限制弧割的弧数.λ′最优有向图是使限制弧连通度尽可能大的一类有向图.定向图是一类重要的有向图.定向图和多部定向图是λ′最优的一些最小度条件将被给出.这些结果推广了Grüter等关于竞赛图的相关结论. 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 minimum cardinality over all restricted arc cuts.λ′-optimal digraphs are the digraphs with the largest possible restricted arc connectivity. The oriented graph is an important class of digraphs. This paper discusses some minimum degree conditions that guarantee (multipartite) oriented graphs being λ′-optimal. Our results extend those of Grüter et al. for tournaments.

参考



全文: PDF      下载: 560      浏览: 182


counter for myspace
云南民族大学学报(自然科学版) 1991—2016 Copyright
地址:云南省昆明市一二.一大街134号 邮编:650031 全国邮发代号:64-47
电话:0871-65132114 传真:0871-65137493 Email:ynmzxyxb@163.com