Skip to main content
SpringerLink
Log in

Independent spanning trees of product graphs

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1197))

Included in the following conference series:

Abstract

A graph G is called an n-channel graph at vertex r if there are n independent spanning trees rooted at r. A graph G is called an n-channel graph if for every vertex u, G is an n-channel graph at u. Independent spanning trees of a graph play an important role in faulttolerant broadcasting in the graph. In this paper we show that if G 1 is an n 1-channel graph and G 2 is an n 2-channel graph, then G 1×G 2 is an (n 1 +n 2)-channel graph. We prove this fact by a construction of n 1+n 2 independent spanning trees of G 1 × G 2 from n 1 independent spanning trees of G 1 and n 2 independent spanning trees of G 2.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Bao, Y. Igarashi, K. Katano: Broadcasting in hypercubes with randomly distributed Byzantine faults. 9th International Workshop on Distributed Algorithms Le Mont-Saint-Michel LNCS 972 (1995) 215–229

    Google Scholar 

  2. F. Bao, Y. Igarashi, S. R. öhring: Reliable broadcasting in product networks. IEICE Technical Report COMP 95-18 (1995) 57–66

    Google Scholar 

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

    Google Scholar 

  4. A. Itai, M. Rodeh: The multi-tree approach to reliability in distributed networks. Information and Computation 79 (1988) 43–59

    Google Scholar 

  5. S. Khuller, B. Schieber: On independent spanning trees. Information Processing Letters 42 (1992) 321–323

    Google Scholar 

  6. A. Youssef: Cartesian product networks. The 1991 International Conference on Parallel Processing I (1991) 684–685

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Gunma University, 376, Kiryu, Japan

    Koji Obokata, Yukihiro Iwasaki, Feng Bao & Yoshihide Igarashi

Authors
  1. Koji Obokata
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yukihiro Iwasaki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Feng Bao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yoshihide Igarashi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Fabrizio d'Amore Paolo Giulio Franciosa Alberto Marchetti-Spaccamela

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Obokata, K., Iwasaki, Y., Bao, F., Igarashi, Y. (1997). Independent spanning trees of product graphs. In: d'Amore, F., Franciosa, P.G., Marchetti-Spaccamela, A. (eds) Graph-Theoretic Concepts in Computer Science. WG 1996. Lecture Notes in Computer Science, vol 1197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62559-3_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-62559-3_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62559-9

  • Online ISBN: 978-3-540-68072-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation