Optimal Independent Spanning Trees on Odd Graphs

被引：24

作者：

Kim, Jong-Seok ^{[2
]}

Lee, Hyeong-Ok ^{[1
]}

Cheng, Eddie ^{[3
]}

Liptak, Laszl ^{[3
]}

机构：

[1] Sunchon Natl Univ, Dept Comp Educ, Sunchon 540742, Chonnam, South Korea

[2] Yeungnam Univ, Sch Elect Engn & Comp Sci, Kyongsan 712749, Gyeongbuk, South Korea

[3] Oakland Univ, Dept Math & Stat, Rochester, MI 48309 USA

来源：

JOURNAL OF SUPERCOMPUTING | 2011年 / 56卷 / 02期

关键词：

Optimal independent spanning trees; Odd graphs; Internally disjoint paths; Algorithms; CHORDAL RINGS; SMALL DEPTHS; NETWORKS; CONSTRUCTION; HYPERCUBES;

D O I：

10.1007/s11227-009-0363-9

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

The use of multiple independent spanning trees (ISTs) for data broadcasting in networks provides a number of advantages, including the increase of fault-tolerance and bandwidth. The designs of multiple ISTs on several classes of networks have been widely investigated. In this paper we show a construction algorithm of ISTs on odd graphs, and we analyze that all the lengths of the paths in the ISTs are less than or equal to the length of the shortest path+4, which is optimal. We also prove that the heights of the ISTs we constructed are d+1, which again is optimal, since the fault diameter of an odd graph is d+1.

引用

页码：212 / 225

页数：14

共 50 条

[1] Optimal Independent Spanning Trees on Odd Graphs
Jong-Seok Kim
Hyeong-Ok Lee
Eddie Cheng
László Lipták
[J]. The Journal of Supercomputing, 2011, 56 : 212 - 225
[2] Optimal Independent Spanning Trees on Cartesian Product of Hybrid Graphs
Yang, Jinn-Shyong
Chang, Jou-Ming
[J]. COMPUTER JOURNAL, 2014, 57 (01): : 93 - 99
[3] Independent spanning trees of product graphs
Obokata, K
Iwasaki, Y
Bao, F
Igarashi, Y
[J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1997, 1197 : 338 - 351
[4] The number of spanning trees in odd valent circulant graphs
Chen, XB
Lin, QY
Zhang, FJ
[J]. DISCRETE MATHEMATICS, 2004, 282 (1-3) : 69 - 79
[5] Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
Chen, Xie-Bin
[J]. INFORMATION PROCESSING LETTERS, 2011, 111 (05) : 235 - 238
[6] Optimal independent spanning trees on hypercubes
Tang, SM
Wang, YL
Leu, YH
[J]. JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2004, 20 (01) : 143 - 155
[7] Completely Independent Spanning Trees in Line Graphs
Hasunuma, Toru
[J]. GRAPHS AND COMBINATORICS, 2023, 39 (05)
[8] Completely Independent Spanning Trees in Line Graphs
Toru Hasunuma
[J]. Graphs and Combinatorics, 2023, 39
[9] Independent spanning trees of product graphs and their construction
Obokata, K
Iwasaki, Y
Bao, F
Igarashi, Y
[J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1996, E79A (11) : 1894 - 1903
[10] On completely independent spanning trees in powers of graphs
Hong, Xia
[J]. UTILITAS MATHEMATICA, 2018, 108 : 73 - 87

← 1 2 3 4 5 →