Journal of the Operations Research Society of China ›› 2024, Vol. 12 ›› Issue (2): 540-547.doi: 10.1007/s40305-022-00406-8

Previous Articles    

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
  • Received:2019-11-10 Revised:2022-02-15 Online:2024-06-30 Published:2024-06-12
  • Contact: Ji-Xiang Meng, Jun-Hao Zhang E-mail:mjxxju@sina.com;18690425110@163.com
  • Supported by:
    The research is supported by the National Natural Science Foundation of China (No. 11531011).

Abstract: 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≤hn/2, k = 2 and n is even, and λh(D) = g(k - 1) for 2≤hg 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/2 and n can be divided by k, it can be determined that distinct positive (respectively, negative) λh-superatoms of D are vertex disjoint for 2≤hg.

Key words: Restricted arc-connectivity, λh(D), Super-λh, λh-Atom, λh-Superatom

CLC Number: