Two algorithms for constructing independent spanning trees in (n,k)-star graphs

被引:0
|
作者
Huang, Jie-Fu [1 ]
Cheng, Eddie [2 ]
Hsieh, Sun-Yuan [3 ]
机构
[1] Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan,701, Taiwan
[2] Department of Mathematics and Statistics, Oakland University, MI,48309, United States
[3] Department of Computer Science and Information Engineering, Institute of Medical Informatics, Institute of Manufacturing Information and Systems, International Center for the Scientific Development of Shrimp Aquaculture, Center for Innovative FinTech Busin
来源
IEEE Access | 2020年 / 8卷
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:175932 / 195947
相关论文
共 50 条
  • [21] Optimal Independent Spanning Trees on Odd Graphs
    Kim, Jong-Seok
    Lee, Hyeong-Ok
    Cheng, Eddie
    Liptak, Laszl
    JOURNAL OF SUPERCOMPUTING, 2011, 56 (02): : 212 - 225
  • [22] Optimal Independent Spanning Trees on Odd Graphs
    Jong-Seok Kim
    Hyeong-Ok Lee
    Eddie Cheng
    László Lipták
    The Journal of Supercomputing, 2011, 56 : 212 - 225
  • [23] Completely Independent Spanning Trees in Line Graphs
    Hasunuma, Toru
    GRAPHS AND COMBINATORICS, 2023, 39 (05)
  • [24] Completely Independent Spanning Trees in Line Graphs
    Toru Hasunuma
    Graphs and Combinatorics, 2023, 39
  • [25] On completely independent spanning trees in powers of graphs
    Hong, Xia
    UTILITAS MATHEMATICA, 2018, 108 : 73 - 87
  • [26] Independent spanning trees of product graphs and their construction
    Obokata, K
    Iwasaki, Y
    Bao, F
    Igarashi, Y
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1996, E79A (11) : 1894 - 1903
  • [27] Constructing independent spanning trees for locally twisted cubes
    Liu, Yi-Jiun
    Lan, James K.
    Chou, Well Y.
    Chen, Chiuyuan
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (22) : 2237 - 2252
  • [28] Constructing completely independent spanning trees in crossed cubes
    Cheng, Baolei
    Wang, Dajin
    Fan, Jianxi
    DISCRETE APPLIED MATHEMATICS, 2017, 219 : 100 - 109
  • [29] Constructing Independent Spanning Trees in Alternating Group Networks
    Huang, Jie-Fu
    Hsieh, Sun-Yuan
    COMPUTING AND COMBINATORICS (COCOON 2020), 2020, 12273 : 198 - 209
  • [30] Balanced spanning trees in complete and incomplete star graphs
    Chen, TS
    Tseng, YC
    Sheu, JP
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1996, 7 (07) : 717 - 723