Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Taiyuan Normal University(Natural Science Edition)》 2018-01
Add to Favorite Get Latest Update

Lower Bounds on the Arc-Connectivity of Digraphs Depending on Clique Number

WANG Xiaoli;School of Mathematics and Physics,Jinzhong University;  
Interconnection networks are often modeled by digraphs.The arc-connectivityλ(D)of a digraph Dis an important measurement for fault tolerance of networks.Letδ(D)be the minimum degree of D,thenλ(D)≤δ(D).We present lower bounds on the arc-connectivity of digraphs depending on clique number,which are expressed in terms of the degree sequence.
【Fund】: 2016年度博士基金科研项目(bsjj2016202)
【CateGory Index】: O157.5
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved