caa a22 4500 445852062 CHVBK 20180317145416.0 cr unu---uuuuu 170323e20110501xx s 000 0 eng 10.1007/s11227-009-0363-9 doi (NATIONALLICENCE)springer-10.1007/s11227-009-0363-9 Optimal Independent Spanning Trees on Odd Graphs [Elektronische Daten] [Jong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, László Lipták] The use of multiple independent spanning trees (ISTs) for data broadcasting in networks provides anumber 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 aconstruction 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. Springer Science+Business Media, LLC, 2009 Optimal independent spanning trees nationallicence Odd graphs nationallicence Internally disjoint paths nationallicence Algorithms nationallicence Kim Jong-Seok School of Electrical Engineering and Computer Science, Yeungnam University, 712-749, Gyeongsan, Gyeongbuk, Korea aut Lee Hyeong-Ok Department of Computer Education, Sunchon National University, 540-742, Sunchon, Chonnam, Korea aut Cheng Eddie Department of Mathematics and Statistics, Oakland University, 48309, Rochester, MI, USA aut Lipták László Department of Mathematics and Statistics, Oakland University, 48309, Rochester, MI, USA aut The Journal of Supercomputing Springer US; http://www.springer-ny.com 56/2(2011-05-01), 212-225 0920-8542 56:2<212 2011 56 11227 https://doi.org/10.1007/s11227-009-0363-9 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s11227-009-0363-9 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Kim Jong-Seok School of Electrical Engineering and Computer Science, Yeungnam University, 712-749, Gyeongsan, Gyeongbuk, Korea aut NATIONALLICENCE 700 1- Lee Hyeong-Ok Department of Computer Education, Sunchon National University, 540-742, Sunchon, Chonnam, Korea aut NATIONALLICENCE 700 1- Cheng Eddie Department of Mathematics and Statistics, Oakland University, 48309, Rochester, MI, USA aut NATIONALLICENCE 700 1- Lipták László Department of Mathematics and Statistics, Oakland University, 48309, Rochester, MI, USA aut NATIONALLICENCE 773 0- The Journal of Supercomputing Springer US; http://www.springer-ny.com 56/2(2011-05-01), 212-225 0920-8542 56:2<212 2011 56 11227 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer