The vertex-pancyclicity of data center networks

被引：8

作者：

Hao, Rong-Xia ^{[1
]}

Tian, Zengxian ^{[1
]}

机构：

[1] Beijing Jiaotong Univ, Dept Math, Beijing 100044, Peoples R China

来源：

THEORETICAL COMPUTER SCIENCE | 2021年 / 855卷

基金：

中国国家自然科学基金;

关键词：

Data center network; Pancyclicity; Network; Hamiltonian cycle; Vertex-pancyclicity; HYPERCUBE; BLOCK;

D O I：

10.1016/j.tcs.2020.11.027

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The k-dimensional data center network with n-port switches, denoted by D-k,D-n, has been proposed for data centers as a server centric network structure. Wang et al. had proved that D-k,D-n is Hamiltonian-connected for k >= 0 and n >= 2 except for (k, n) = (1, 2). In this paper, we prove that for any edge (u, v) in a complete subgraph K-n of D-k,D-n, there is a cycle of every length from 3 to vertical bar V (D-k,D-n)vertical bar passing through the edge (u, v) in D-k,D-n for n >= 5. As corollaries, we obtained that D-k,D-n is vertex-pancyclic and pancyclic. (C) 2020 Elsevier B.V. All rights reserved.

引用

页码：74 / 89

页数：16

共 24 条

[1] A scalable, commodity data center network architecture [J].

Al-Fares, Mohammad ;

Loukissas, Alexander ;

Vahdat, Amin .

ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2008, 38 (04) :63-74

[2] EDGE-PANCYCLIC BLOCK-INTERSECTION GRAPHS [J].

ALSPACH, B ;

HARE, D .

DISCRETE MATHEMATICS, 1991, 97 (1-3) :17-24

[3]

[Anonymous], 2011, MATH GAZ

[4]

Anthony S., 2013, MICROSOFT NOW HAS ON

[5]

Bondy J. A., 1971, J. Combin. Theory Ser. B, V11, P80, DOI [10.1016/0095-8956(71)90016-5, DOI 10.1016/0095-8956(71)90016-5]

[6] Conditional edge-fault pancyclicity of augmented cubes [J].

Cheng, Dongqin ;

Hao, Rong-Xia ;

Feng, Yan-Quan .

THEORETICAL COMPUTER SCIENCE, 2013, 510 :94-101

[7]

Dean J, 2004, USENIX ASSOCIATION PROCEEDINGS OF THE SIXTH SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION (OSDE '04), P137

[8] Vertex-pancyclicity of augmented cubes with maximal faulty edges [J].

Fu, Jung-Sheng .

INFORMATION SCIENCES, 2014, 275 :257-266

[9] Strongly Menger connectedness of data center network and (n, k)-star graph [J].

Gu, Mei-Mei ;

He, Shengjie ;

Hao, Rong-Xia ;

Cheng, Eddie .

THEORETICAL COMPUTER SCIENCE, 2019, 799 :94-103

[10] The pessimistic diagnosability of data center networks [J].

Gu, Mei-Mei ;

Hao, Rong-Xia ;

Liu, Jian-Bing .

INFORMATION PROCESSING LETTERS, 2018, 134 :52-56

← 1 2 3 →