摘要
互连网络通常以有向图为模型,有向图的弧连通度是网络可靠性的一个重要参数.给出了依赖团数的有向图极大和超级边连通的度序列条件.
Interconnection networks are often modeled by digraphs.The arc-connectivity of a digraph is an important measurement for fault tolerance of networks.In this paper, we present degree sequence conditions for maximally and super edge-connected digraphs depending on the clique number.
作者
王晓丽
WANG Xiao-li(School of Mathematics and Physics,Jinzhong University,Jinzhong 030619,China)
出处
《数学的实践与认识》
北大核心
2019年第1期252-255,共4页
Mathematics in Practice and Theory
基金
国家自然科学基金(61070229)
2016年度晋中学院博士基金科研项目(bsjj2016202)
关键词
团数
弧连通度
度序列
clique number
arc-connectivity
degree sequence
