Construction of independent spanning trees on twisted-cubes

2011 ◽  
Author(s):  
Yan Wang ◽  
Jianxi Fan ◽  
Yuejuan Han
Keyword(s):  
Spanning Trees ◽  
Independent Spanning Trees ◽  
Twisted Cubes

Independent spanning trees on twisted cubes

2012 ◽  
Vol 72 (1) ◽  
pp. 58-69 ◽  
Author(s):  
Yan Wang ◽  
Jianxi Fan ◽  
Guodong Zhou ◽  
Xiaohua Jia
Keyword(s):  
Spanning Trees ◽  
Independent Spanning Trees ◽  
Twisted Cubes

Construction independent spanning trees on locally twisted cubes in parallel

2016 ◽  
Vol 33 (3) ◽  
pp. 956-967 ◽  
Author(s):  
Yu-Huei Chang ◽  
Jinn-Shyong Yang ◽  
Sun-Yuan Hsieh ◽  
Jou-Ming Chang ◽  
Yue-Li Wang
Keyword(s):  
Spanning Trees ◽  
Locally Twisted Cubes ◽  
Independent Spanning Trees ◽  
Twisted Cubes

Constructing independent spanning trees for locally twisted cubes

2011 ◽  
Vol 412 (22) ◽  
pp. 2237-2252 ◽  
Author(s):  
Yi-Jiun Liu ◽  
James K. Lan ◽  
Well Y. Chou ◽  
Chiuyuan Chen
Keyword(s):  
Spanning Trees ◽  
Locally Twisted Cubes ◽  
Independent Spanning Trees ◽  
Twisted Cubes

Independent Spanning Trees on Special BC Networks

2012 ◽  
Vol 263-266 ◽  
pp. 3301-3305
Author(s):  
Bao Lei Cheng ◽  
Jian Xi Fan ◽  
Ji Wen Yang ◽  
Yan Wang ◽  
Shu Kui Zhang
Keyword(s):  
Connected Graph ◽  
Spanning Trees ◽  
Independent Spanning Trees ◽  
Twisted Cubes

There is a well-known conjecture on independent spanning trees (ISTs) on graphs: For any n-connected graph G with n≥1, there are n ISTs rooted at an arbitrary node on G. It still remains open for n≥5. We propose an integrated algorithm to construct n ISTs rooted at any node similar to 0 or 10n-1 on n-dimensional HCH cube for n≥1 and give the simulations of ISTs on several special BC networks, such as HCH cubes, crossed cubes, Möbius cubes, twisted cubes, etc.

Sign in / Sign up

Export Citation Format

Share Document