The super connectivity of shuffle-cubes

Authors:
Jun-Ming Xu;Min Xu;Qiang Zhu
Affiliations:
Department of Mathematics, University of Science and Technology of China, Hefei, Anhui, China;Institute of Applied Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China;Department of Mathematics, XiDian University, Xi'an, Shanxi, China
Venue:
Information Processing Letters
Year:
2005

Citing 4
Cited 1

On computing a conditional edge-connectivity of a graph

Information Processing Letters
Generalized Measures of Fault Tolerance with Application to N-Cube Networks

IEEE Transactions on Computers
The shuffle-cubes and their generalization

Information Processing Letters
Graph Theory With Applications

Graph Theory With Applications

The super connectivity of augmented cubes

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

The shuffle-cube SQn, where n ≡ 2 (mod 4), a new variation of hypercubes proposed by Li et al. [T.-K. Li, J.J.M. Tan, L.-H. Hsu, T.-Y. Sung, The shuffle-cubes and their generalization, Inform. Process. Lett. 77 (2001) 35-41], is an n-regular n-connected graph. This paper determines that the super connectivity of SQn is 2n - 4 and the super edge-connectivity is 2n - 2 for n ≥ 6.