Restricted Connectivity of Crossed Cubes*
CAI Xue-peng, Elkin Vumar
【摘 要】Abstract：Given a graph G and non-negative integer h, the h-restricted connectivity of G is the minimum cardinality of a set of vertices in G,if exists, whose deletion disconnects G and the degree of each vertex in every remaining component is at least h. As a variant of the hypercube,the crossed cube interconnection networks is one of the most popular interconnection networks for parallel/communication system. In this paper,we show that 2-and 3-restricted connectivity of n-dimensional crossed cubes are respectively 4n-8 for n≥4 and 8n-24 for n≥5.
【期刊名称】曲阜师范大学学报（自然科学版） 【年(卷),期】2018(044)003 【总页数】8
【关键词】Key words：restricted connectivity; interconnection network; crossed cube
CLC number： O157.6 Document code：A
Article ID：1001-5337(2018)03-0025-08 *Received data：2018-03-08
Foundation item：National Natural Science Foundation of China (11671227).
交叉立方体的限制性连通度
