[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Optimal Independent Spanning Trees on Odd Graphs

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bao F, Igarashi Y, Öhring SR (1998) Reliable broadcasting in product networks. Discrete Appl Math 83:3–20

    Article  MathSciNet  MATH  Google Scholar 

  2. Biggs N (1979) Some odd graph theory. Ann NY Acad Sci 319:71–81

    Article  MathSciNet  Google Scholar 

  3. Cheriyan J, Maheshwari SN (1988) Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. J Algorithms 9:507–537

    Article  MathSciNet  MATH  Google Scholar 

  4. Curran S, Lee O, Yu X (2006) Finding four independent trees. SIAM J Comput 35:1023–1058

    Article  MathSciNet  MATH  Google Scholar 

  5. Ge Z, Hakimi SL (1997) Disjoint rooted spanning trees with small depths in de Bruijn and Kautz graphs. SIAM J Comput 26:79–92

    Article  MathSciNet  Google Scholar 

  6. Ghafoor A, Bashkow TR (1991) A study of odd graphs as fault-tolerant interconnection networks. IEEE Trans Comput 40(2):225–232

    Article  MathSciNet  Google Scholar 

  7. Hasunuma T, Nagamochi H (2001) Independent spanning trees with small depths in iterated line digraphs. Discrete Appl Math 110:189–211

    Article  MathSciNet  MATH  Google Scholar 

  8. Hsieh S-Y, Tu C-J (2009) Constructing edge-disjoint spanning trees in locally twisted cubes. Theor Comput Sci 410:926–932

    Article  MathSciNet  MATH  Google Scholar 

  9. Huck A (1994) Independent trees in graphs. Graphs Comb 10:29–45

    Article  MathSciNet  MATH  Google Scholar 

  10. Huck A (1999) Independent trees in planar graphs. Graphs Comb 15:29–77

    Article  MathSciNet  MATH  Google Scholar 

  11. Itai A, Rodeh M (1988) The multi-tree approach to reliability in distributed networks. Inf Comput 79:43–59

    Article  MathSciNet  MATH  Google Scholar 

  12. Iwasaki Y, Kajiwara Y, Obokata K, Ugarashi Y (1999) Independent spanning trees of chordal rings. Inf Process Lett 69:155–160

    Article  Google Scholar 

  13. Kim J-S, Lee H-O (2008) Comments on “A study of odd graphs as fault-tolerant interconnection networks. IEEE Trans Comput 57(6):864

    Article  MathSciNet  Google Scholar 

  14. Kim J-S, Lee H-O (2008) One-to-all broadcasting of odd networks for one-port and all-port models. ETRI J 30(6):856–858

    Article  Google Scholar 

  15. Kim J-S, Cheng E, Lipták L, Lee H-O (2009) Embedding hypercubes, rings and odd graphs into hyper-stars. Int J Comput Math 86:771–778

    Article  MathSciNet  MATH  Google Scholar 

  16. Meredith GHJ, Llyod EK (1972) The Hamiltonian graphs O 4 to O 7. In: Welsh DJA, Woodal DR (eds) Combinatorics. Institute of Mathematics and Applications, Southend-On-Sea, pp 229–236

    Google Scholar 

  17. Miura K, Takahashi D, Nakano S, Nishizeki T (1999) A linear-time algorithm to find four independent spanning trees in four-connected planar graphs. Int J Found Comput Sci 10:195–210

    Article  MathSciNet  Google Scholar 

  18. Nagai S, Nakano S (2000) A linear-time algorithm to find independent spanning trees in maximal planar graphs. In Proceedings of 26th workshop on graph—theoretic concepts in computer science, WG 2000. LNCS, vol 1928, pp 290–301

  19. Obokata K, Iwasaki Y, Bao F, Igarashi Y (1996) Independent spanning trees of product graphs and their construction. IEICE Trans Fundam Electron Commun Comput Sci E79-A:1894–1903

    Google Scholar 

  20. Parhami B, Kwai D-M (2001) Unified formulation of honeycomb and diamond networks. IEEE Trans Parallel Distrib Syst 12(1):74–80

    Article  Google Scholar 

  21. Tang S-M, Wang Y-L, Leu Y-H (2004) Optimal independent spanning trees on hypercubes. J Inf Sci Eng 20:143–155

    MathSciNet  Google Scholar 

  22. Tang S-M, Yang J-S, Wang Y-L, Chang J-M (2009) Independent spanning trees on multidimensional torus networks. IEEE Trans Comput (to appear)

  23. Yang J-S, Tang S-M, Chang J-M, Wang Y-L (2007) Parallel construction of optimal independent spanning trees on hypercubes. Parallel Comput 33:73–79

    Article  MathSciNet  Google Scholar 

  24. Yang J-S, Chang J-M, Tang S-M, Wang Y-L (2007) Reducing the height of independent spanning trees in chordal rings. IEEE Trans Parallel Distrib Syst 18(5):644–657

    Article  Google Scholar 

  25. Yang J-S, Chang J-M, Tang S-M, Wang Y-L (2009) On the independent spanning trees of recursive circulant graphs G(cd m,d) with d>2. Theor Comput Sci 410:2001–2010

    Article  MathSciNet  MATH  Google Scholar 

  26. Yang J-S, Chang J-M, Tang S-M, Wang Y-L (2009) Constructing multiple independent spanning trees on recursive circulant graphs G(2m,2). Int J Found Comput Sci (to appear)

  27. Zehavi A, Itai A (1989) Three tree-paths. J Graph Theory 13:175–188

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical Engineering and Computer Science, Yeungnam University, Gyeongsan, Gyeongbuk, 712-749, Korea

    Jong-Seok Kim

  2. Department of Computer Education, Sunchon National University, Sunchon, Chonnam, 540-742, Korea

    Hyeong-Ok Lee

  3. Department of Mathematics and Statistics, Oakland University, Rochester, MI, 48309, USA

    Eddie Cheng & László Lipták

Authors
  1. Jong-Seok Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hyeong-Ok Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eddie Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. László Lipták
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hyeong-Ok Lee.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kim, JS., Lee, HO., Cheng, E. et al. Optimal Independent Spanning Trees on Odd Graphs. J Supercomput 56, 212–225 (2011). https://doi.org/10.1007/s11227-009-0363-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-009-0363-9

Search

Navigation