The search functionality is under construction.

The search functionality is under construction.

A set of spanning trees of a graphs *G* are called completely independent spanning trees (CISTs for short) if for every pair of vertices *x*, *y*∈*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 *BH _{n}*, 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

- Publication
- IEICE TRANSACTIONS on Information Vol.E102-D No.12 pp.2409-2412

- Publication Date
- 2019/12/01

- Publicized
- 2019/06/17

- Online ISSN
- 1745-1361

- DOI
- 10.1587/transinf.2019PAL0001

- Type of Manuscript
- Special Section LETTER (Special Section on Parallel and Distributed Computing and Networking)

- Category
- Fundamentals of Information Systems

Yi-Xian YANG

National Taipei University of Business

Kung-Jui PAI

Ming Chi University of Technology

Ruay-Shiung CHANG

National Taipei University of Business

Jou-Ming CHANG

National Taipei University of Business

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Yi-Xian YANG, Kung-Jui PAI, Ruay-Shiung CHANG, Jou-Ming CHANG, "Constructing Two Completely Independent Spanning Trees in Balanced Hypercubes" in IEICE TRANSACTIONS on Information,
vol. E102-D, no. 12, pp. 2409-2412, December 2019, doi: 10.1587/transinf.2019PAL0001.

Abstract: A set of spanning trees of a graphs *G* are called completely independent spanning trees (CISTs for short) if for every pair of vertices *x*, *y*∈*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 *BH _{n}*, 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

URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2019PAL0001/_p

Copy

@ARTICLE{e102-d_12_2409,

author={Yi-Xian YANG, Kung-Jui PAI, Ruay-Shiung CHANG, Jou-Ming CHANG, },

journal={IEICE TRANSACTIONS on Information},

title={Constructing Two Completely Independent Spanning Trees in Balanced Hypercubes},

year={2019},

volume={E102-D},

number={12},

pages={2409-2412},

abstract={A set of spanning trees of a graphs *G* are called completely independent spanning trees (CISTs for short) if for every pair of vertices *x*, *y*∈*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 *BH _{n}*, 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

keywords={},

doi={10.1587/transinf.2019PAL0001},

ISSN={1745-1361},

month={December},}

Copy

TY - JOUR

TI - Constructing Two Completely Independent Spanning Trees in Balanced Hypercubes

T2 - IEICE TRANSACTIONS on Information

SP - 2409

EP - 2412

AU - Yi-Xian YANG

AU - Kung-Jui PAI

AU - Ruay-Shiung CHANG

AU - Jou-Ming CHANG

PY - 2019

DO - 10.1587/transinf.2019PAL0001

JO - IEICE TRANSACTIONS on Information

SN - 1745-1361

VL - E102-D

IS - 12

JA - IEICE TRANSACTIONS on Information

Y1 - December 2019

AB - A set of spanning trees of a graphs *G* are called completely independent spanning trees (CISTs for short) if for every pair of vertices *x*, *y*∈*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 *BH _{n}*, 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

ER -