Restricted Arc-Connectivity of Harary Digraphs  

作　　者：Jun-Hao Zhang Ji-Xiang Meng 

机构地区：[1]College of Mathematics and System Science,Xinjiang University,Urumqi 830046,XinJiang,China

出　　处：《Journal of the Operations Research Society of China》2024年第2期540-547,共8页中国运筹学会会刊（英文）

基　　金：the National Natural Science Foundation of China(No.11531011).

摘　　要：The h-restricted arc-connectivity of a digraph is an important parameter to measure fault-tolerance of interconnection networks.This paper determines that the h-restricted arc-connectivity of the Harary digraph D=G(n;1,2,.:,k)is equal to n/2 for 2≤h≤n/2,k=2 and n iseven,andλ_(h)(D)=g(k-1)for 2<h≤g and 3≤k≤n/2,where g is the girth of D.As consequences,the super restricted arc-connectedness of Harary digraph D is obtained immediately.In particular,for k=2 and n is even or 3≤k<n/2and n can be divided by k,it can be determined that distinct positive(respectively,negative)Ah-superatoms of D are vertex disjoint for 2≤h≤g.

关 键 词：Restricted arc-connectivity λ_(h)(D) Super-λ_(h) λ_(h)-Atom λ_(h)-Superatom 

分 类 号：O15[理学—数学]