有向图边接通度的下界(英文)  

Lower Bounds on the Arc-strong Connectivity of Digraphs

作　　者：王世英[1] 王瑞霞[1] 王晓丽[1] 林上为[1] 

机构地区：[1]山西大学数学科学学院,山西太原030006

出　　处：《山西大学学报（自然科学版）》2009年第4期516-520,共5页Journal of Shanxi University(Natural Science Edition)

基　　金：The Natural Science Foundation of Shanxi Province(2008011010)

摘　　要：有向图常模拟互联网络.因此,对于网络的容错性,有向图的边连通度是一个重要的度量.文章用度序列给出了有向图的边连通度的新的下界.Since interconnection networks are often modeled by digraphs,the arc-strong connectivity of a digraph is an important measurement for fault tolerance of networks.In this paper,we present lower bounds on the arc-strong connectivity of a digraph,which are expressed in terms of the degree sequence.

关 键 词：容错性 边连通度 度序列 偶图 有向图 

分 类 号：O157[理学—数学]