摘要
互连网络通常以有向图为模型.弧连通度是网络可靠性的一个重要参数.设D是一个有向图,δ(D)是最小度,弧连通度为λ(D),则λ(D)≤δ(D).当λ(D)<δ(D)时,称有向图D是非极大弧连通的.本文给出了非极大弧连通图弧连通度的一些结果.
Interconnection networks are often modeled by digraphs. The arc-connectivity λ( D) is an important measurement for fault tolerance of networks. Let δ( D) be the minimum degree of D. Thenλ( D) ≤ δ( D). A digraph is called non-maximally arc-connected if λ( D) < δ( D). To present some results on the arc-connectivity of non-maximally arc-connected digraphs.
作者
王晓丽
张磊
WANG Xiaoii;ZHANG Lei(School of Mathematics,Jinzhong University,Jinzhong 030619,China)
出处
《太原师范学院学报（自然科学版）》
2019年第4期12-14,共3页
Journal of Taiyuan Normal University:Natural Science Edition
基金
晋中学院博士基金资助项目(bsjj2016202)
关键词
团数
弧连通度
度序列
clique number
arc-connectivity
degree sequence
