| 有向图边接通度的下界 |
| |
| 引用本文： | 王世英,王瑞霞,王晓丽,林上为.有向图边接通度的下界[J].山西大学学报(自然科学版),2009,32(4). |
| |
| 作者姓名： | 王世英 王瑞霞 王晓丽 林上为 |
| |
| 作者单位： | 山西大学,数学科学学院,山西,太原,030006 |
| |
| 摘 要： | 有向图常模拟互联网络.因此,对于网络的客错性,有向图的边连通度是一个重要的度量.文章用度序列给出了有向图的边连通度的新的下界.
|
| 关 键 词： | 容错性 边连通度 度序列 偶图 有向图 |
Lower Bounds on the Arc-strong Connectivity of Digraphs |
| |
| Abstract: | 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 con-nectivity of a digraph,which are expressed in terms of the degree sequence. |
| |
| Keywords: | fault tolerance arc-strong connectivity degree sequence bipartite digraph oriented graph |
| 本文献已被 万方数据 等数据库收录！ |
|
