期刊
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
卷 E102D, 期 12, 页码 2409-2412出版社
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
DOI: 10.1587/transinf.2019PAL0001
关键词
interconnection networks; completely independent spanning trees; balanced hypercubes; diameter
资金
- MOST from the Ministry of Science and Technology, Taiwan [107-2221-E-131-001, 107-2221-E-141-002, 107-2221-E-141-001-MY3]
A set of spanning trees of a graphsG are called completely independent spanning trees (CISTs for short) if for every pair of vertices x, y is an element of V(G), the paths joining x and y in any two trees have neither vertex nor edge in common, except x and y. Constructing CISTs has applications on interconnection networks such as fault-tolerant routing and secure message transmission. In this paper, we investigate the problem of constructing two CISTs in the balanced hypercube BHn, which is a hypercube-variant network and is superior to hypercube due to having a smaller diameter. As a result, the diameter of CISTs we constructed equals to 9 for BH2 and 6n - 2 for BHn when n >= 3.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据