Journal of the Operations Research Society of China ›› 2019, Vol. 7 ›› Issue (3): 501-509.doi: 10.1007/s40305-019-00259-8

Special Issue: Discrete optimization

Previous Articles    

Conditional Edge Connectivity of the Locally Twisted Cubes

Hui Shang, Eminjan Sabir, Ji-Xiang Meng   

  1. College of Mathematics and System Sciences, Xinjiang University, Urumqi 830046, China
  • Received:2018-11-21 Revised:2019-05-11 Online:2019-09-30 Published:2019-10-08
  • Contact: Ji-Xiang Meng, Hui Shang, Eminjan Sabir E-mail:mjxxju@sina.com;hui_shang1218@163.com;eminjan20150513@163.com

Abstract: The k-component edge connectivity k(G) of a non-complete graph G is the minimum number of edges whose deletion results in a graph with at least k components. In this paper, we extend some results by Guo et al. (Appl Math Comput 334:401-406, 2018) by determining the component edge connectivity of the locally twisted cubes LTQn, i.e., k+1(LTQn)=kn -exk/2 for 1 ≤ k ≤ 2[n/2], n ≥ 7, where exk=∑i=0s ti2ti +∑i=0si·2ti, and k is a positive integer with decomposition k=∑i=0s 2ti such that t0=⎣log2k⎦ and ti=⎣log2(k -∑r=0i-12tr)⎦ for i ≥ 1. As a by-product, we characterize the corresponding optimal solutions.

Key words: Fault tolerance, Locally twisted cubes, Component edge connectivity

CLC Number: