依赖团数的有向图极大与超级边连通的度序列条件  

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)

机构地区：[1]晋中学院数理学院,山西晋中030619

出　　处：《数学的实践与认识》2019年第1期252-255,共4页Mathematics in Practice and Theory

基　　金：国家自然科学基金(61070229);2016年度晋中学院博士基金科研项目(bsjj2016202)

摘　　要：互连网络通常以有向图为模型,有向图的弧连通度是网络可靠性的一个重要参数.给出了依赖团数的有向图极大和超级边连通的度序列条件.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.

关 键 词：团数 弧连通度 度序列 

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