TY - JOUR
T1 - Completely independent spanning trees on 4-regular chordal rings
AU - Chang, Jou Ming
AU - Chang, Hung Yi
AU - Wang, Hung Lung
AU - Pai, Kung Jui
AU - Yang, Jinn Shyong
N1 - Publisher Copyright:
Copyright © 2017 The Institute of Electronics, Information and Communication Engineers.
PY - 2017/9
Y1 - 2017/9
N2 - Given a graph G, a set of spanning trees of G are completely independent spanning trees (CISTs for short) if for any vertices x and y, the paths connecting them on these trees have neither vertex nor edge in common, except x and y. Hasunuma (2001, 2002) first introduced the concept of CISTs and conjectured that there are k CISTs in any 2kconnected graph. Later on, this conjecture was unfortunately disproved by Peterfalvi (2012). In this note, we show that Hasunuma's conjecture holds for graphs restricted in the class of 4-regular chordal rings CR(n; d), where both n and d are even integers.
AB - Given a graph G, a set of spanning trees of G are completely independent spanning trees (CISTs for short) if for any vertices x and y, the paths connecting them on these trees have neither vertex nor edge in common, except x and y. Hasunuma (2001, 2002) first introduced the concept of CISTs and conjectured that there are k CISTs in any 2kconnected graph. Later on, this conjecture was unfortunately disproved by Peterfalvi (2012). In this note, we show that Hasunuma's conjecture holds for graphs restricted in the class of 4-regular chordal rings CR(n; d), where both n and d are even integers.
KW - Chordal rings
KW - Completely independent spanning trees
KW - Distributed loop networks
UR - http://www.scopus.com/inward/record.url?scp=85028768901&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85028768901&partnerID=8YFLogxK
U2 - 10.1587/transfun.E100.A.1932
DO - 10.1587/transfun.E100.A.1932
M3 - Article
AN - SCOPUS:85028768901
SN - 0916-8508
VL - E100A
SP - 1932
EP - 1935
JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
IS - 9
ER -