Down to Earth - How to Visualize Traffic on High-dimensional Torus Networks

Author(s):  
Lucas Theisen ◽  
Aamer Shah ◽  
Felix Wolf
2017 ◽  
Vol 687 ◽  
pp. 40-47 ◽  
Author(s):  
Xiaomin Hu ◽  
Yingzhi Tian ◽  
Xiaodong Liang ◽  
Jixiang Meng

2011 ◽  
Vol 412 (4-5) ◽  
pp. 307-319 ◽  
Author(s):  
Ryotaro Okazaki ◽  
Hirotaka Ono ◽  
Taizo Sadahiro ◽  
Masafumi Yamashita

2013 ◽  
Vol 161 (3) ◽  
pp. 404-423 ◽  
Author(s):  
Jun Yuan ◽  
Aixia Liu ◽  
Hongmei Wu ◽  
Jing Li

2020 ◽  
Vol 2 (2) ◽  
Author(s):  
Jumpei F. Yamagishi ◽  
Kunihiko Kaneko

2021 ◽  
Vol 293 ◽  
pp. 157-165
Author(s):  
Xiaomin Hu ◽  
Yingzhi Tian ◽  
Jixiang Meng ◽  
Weihua Yang

2018 ◽  
Vol 28 (04) ◽  
pp. 1850013 ◽  
Author(s):  
Miao Lu ◽  
Shurong Zhang ◽  
Weihua Yang

It is well known that an [Formula: see text]-dimensional torus [Formula: see text] is Hamiltonian. Then the torus [Formula: see text] contains a spanning subgraph which is 2-regular and 2-connected. In this paper, we explore a strong property of torus networks. We prove that for any even integer [Formula: see text] with [Formula: see text], the torus [Formula: see text] contains a spanning subgraph which is [Formula: see text]-regular, k-connected and bipancyclic; and if [Formula: see text] is odd, the result holds when some [Formula: see text] is even.


Sign in / Sign up

Export Citation Format

Share Document