Completely Independent Spanning Trees on 4-Regular Chordal Rings-Reference-Cited by-同舟云学术

Completely Independent Spanning Trees on 4-Regular Chordal Rings

Published:2017 Issue:9 Volume:E100.A Page:1932-1935
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

CHANG Jou-Ming¹,CHANG Hung-Yi¹,WANG Hung-Lung¹,PAI Kung-Jui²,YANG Jinn-Shyong³

Affiliation:

1. Institute of Information and Decision Sciences, National Taipei University of Business

2. Department of Industrial Engineering and Management, Ming Chi University of Technology

3. Department of Information Management, National Taipei University of Business

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing

Link

https://www.jstage.jst.go.jp/article/transfun/E100.A/9/E100.A_1932/_pdf

Reference17 articles.

1. [1] T. Araki, “Dirac's condition for completely independent spanning trees,” J. Graph Theory, vol.77, no.3, pp.171-179, 2014. 10.1002/jgt.21780

2. [2] B.W. Arden and H. Lee, “Analysis of chordal ring network,” IEEE Trans. Comput., vol.30, no.4, pp.291-295, 1981. 10.1109/tc.1981.1675777

3. [3] J.C. Bermond, F. Comellas, and D.F. Hsu, “Distributed loop computer networks: A survey,” J. Parallel Distrib. Comput., vol.24, no.1, pp.2-10, 1995. 10.1006/jpdc.1995.1002

4. [4] H.-Y. Chang, H.-L. Wang, J.-S. Yang, and J.-M. Chang, “A note on the degree condition of completely independent spanning trees,” IEICE Trans. Fundamentals, vol.E98-A, no.10, pp.2191-2193, Oct. 2015. 10.1587/transfun.e98.a.2191

5. [5] G. Fan, Y. Hong, and Q. Liu, “Ore's condition for completely independent spanning trees,” Discrete Appl. Math., vol.177, pp.95-100, 2014. 10.1016/j.dam.2014.06.002

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Independent Spanning Trees in Networks: A Survey;ACM Computing Surveys;2023-07-17

2. Completely Independent Spanning Trees on BCCC Data Center Networks With an Application to Fault-Tolerant Routing;IEEE Transactions on Parallel and Distributed Systems;2022-08-01

3. Constructing tri-CISTs in shuffle-cubes;Journal of Combinatorial Optimization;2022-05-09

4. Configuring Protection Routing via Completely Independent Spanning Trees in Dense Gaussian On-Chip Networks;IEEE Transactions on Network Science and Engineering;2022-03-01

5. Three completely independent spanning trees of crossed cubes with application to secure-protection routing;Information Sciences;2020-12