Skip to main content
SpringerLink
Log in
Book cover

Structural Analysis of Complex Networks pp 169–196Cite as

Decompositions and Factorizations of Complete Graphs

  • Chapter
  • First Online:

Abstract

Graph decompositions into isomorphic copies of a given graph are a well-established topic studied in both graph theory and design theory. Although spanning tree factorizations may seem to be just a special case of this concept, not many general results are known. We investigate necessary and sufficient conditions for a graph factorization into isomorphic spanning trees to exist.

MSC2000: Primary 05C70; Secondary 05C78, 05C05

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alspach B, Gavlas H (2001) Cycle decompositions of K n and K n − I. J Combin Theory B 81:77–99

    Article  MATH  MathSciNet  Google Scholar 

  2. Bloom GS (1979) A chronology of the Ringel-Kotzig conjecture and the continuing quest to call all trees graceful. In: Topics in graph theory. The New York Academy of Sciences

    Google Scholar 

  3. Bosák J (1986) Decompositions of graphs. VEDA, Bratislava

    Google Scholar 

  4. Bosák J, Erdös P, Rosa A (1972) Decompositions of complete graphs into factors with diameter two. Mat časopis Slov akad vied 22:14–28

    Google Scholar 

  5. Bosák J, Rosa A, Znám Š (1968) On decompositions of complete graphs into factors with given diameters. In: Theory of Graphs (Proc Colloq Tihany 1966), Akademiai Kiadó, Budapest, pp 37–56

    Google Scholar 

  6. Colbourn CJ, Dinitz JH (eds) (2007) The CRC handbook of combinatorial designs, 2nd edn. Discrete mathematics and its applications. CRC press, Boca Raton

    Google Scholar 

  7. Diestel R (2006) Graph theory, 3rd edn. Springer, Berlin Heidelberg

    Google Scholar 

  8. Eldergill P (1997) Decompositions of the complete graph with an even number of vertices. M.Sc. thesis, McMaster University, Hamilton

    Google Scholar 

  9. El-Zanati S, Vanden Eynden C (1999) Factorizations of K m, n into spanning trees. Graph Combinator 15:287–293

    Article  MATH  MathSciNet  Google Scholar 

  10. Fronček D (2004) Cyclic decompositions of complete graphs into spanning trees. Discuss Math Graph Theory 24(2):345–353

    MATH  MathSciNet  Google Scholar 

  11. Fronček D (2006) Note on factorizations of complete graphs into caterpillars with small diameters. JCMCC 57:179–186

    MATH  Google Scholar 

  12. Fronček D (2007) Bi-cyclic decompositions of complete graphs into spanning trees. Discrete Math 307:1317–1322

    Article  MATH  MathSciNet  Google Scholar 

  13. Fronček D, Kovářová T (2007) 2n-cyclic blended labeling of graphs. Ars Combinatoria 83:129–144

    MATH  MathSciNet  Google Scholar 

  14. Fronček D, Kovář P, Kovářová T, Kubesa M (2010) Factorizations of complete graphs into caterpillars of diameter 5. Discrete Math 310:537–556

    Article  MATH  MathSciNet  Google Scholar 

  15. Fronček D, Kovář P, Kubesa M Factorizations of complete graphs into trees with at most four non-leave vertices, (submitted)

    Google Scholar 

  16. Fronček D, Kubesa M (2002) Factorizations of complete graphs into spanning trees. Congr Numer 154:125–134

    MATH  MathSciNet  Google Scholar 

  17. Gallian JA (2003) A dynamic survey of graph labeling. Electron J Combinator DS6

    Google Scholar 

  18. Golomb SW (1972) How to number a graph, in graph theory and computing. In: Read RC (ed) Academic, New York, pp 23–37

    Google Scholar 

  19. Gronau H-DOF, Grütmüller M, Hartman S, Leck U, Leck V (2002) On orthogonal double covers of graphs. Design Code Cryptogr 27:49–91

    Article  MATH  Google Scholar 

  20. Kovářová T (2005) Decompositions of complete graphs into isomorphic spanning trees with given diameters. JCMCC 54:67–81

    MATH  Google Scholar 

  21. Kovářová T (2004) Fixing labelings and factorizations of complete graphs into caterpillars with diameter four. Congr Numer 168:33–48

    MATH  MathSciNet  Google Scholar 

  22. Kovářová T (2004) Spanning tree factorizations of complete graphs. Ph.D. thesis, VŠB – Technical University of Ostrava

    Google Scholar 

  23. Kubesa M (2004) Factorizations of complete graphs into [n,r,s,2]-caterpillars of diameter 5 with maximum center. AKCE Int J Graph Combinator 1(2):135–147

    MATH  MathSciNet  Google Scholar 

  24. Kubesa M (2004) Factorizations of complete graphs into caterpillars of diameter four and five. Ph.D. thesis, VŠB – Technical University of Ostrava

    Google Scholar 

  25. Kubesa M (2005) Spanning tree factorizations of complete graphs. JCMCC 52:33–49

    MATH  MathSciNet  Google Scholar 

  26. Kubesa M (2005) Factorizations of complete graphs into [r,s,2,2]-caterpillars of diameter 5. JCMCC 54:187–193

    MATH  MathSciNet  Google Scholar 

  27. Kubesa M (2006) Factorizations of complete graphs into [n,r,s,2]-caterpillars of diameter 5 with maximum end. AKCE Int J Graph Combinator 3(2):151–161

    MATH  MathSciNet  Google Scholar 

  28. Kubesa M (2007) Factorizations of complete graphs into [r,s,t,2]-caterpillars of diameter 5. JCMCC 60:181–201

    MATH  MathSciNet  Google Scholar 

  29. Meszka M (2008) Solution to the problem of Kubesa. Discuss Math Graph Theory 28:375–378

    MATH  MathSciNet  Google Scholar 

  30. Palumbíny D (1973) On decompositions of complete graphs into factors with equal diameters. Boll Un Mat Ital 7:420–428

    MATH  MathSciNet  Google Scholar 

  31. Rosa A (1967) On certain valuations of the vertices of a graph. In: Theory of graphs (Intl Symp Rome 1966), Gordon and Breach, Dunod, Paris, pp 349–355

    Google Scholar 

  32. Shibata Y, Seki Y (1992) The isomorphic factorization of complete bipartite graphs into trees. Ars Combinatoria 33:3–25

    MATH  MathSciNet  Google Scholar 

  33. Tan ND (2008) On a problem of Fronček and Kubesa. Australas J Combinator 40:237–245

    MATH  Google Scholar 

  34. Vetrík T (2006) On factorization of complete graphs into isomorphic caterpillars of diameter 6. Magia 22:17–21

    Google Scholar 

  35. West DB (2001) Introduction to graph theory, 2nd edn. Prentice-Hall, Upper Saddle River, NJ

    Google Scholar 

  36. Yap HP (1988) Packing of graphs – a survey. Discrete Math 72:395–404

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

Supported by the Ministry of Education of the Czech Republic Grant No. MSM6198910027. The author wants to thank the anonymous referees, whose comments helped in improving the quality of this chapter.

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Technical University Ostrava, 17. listopadu, 708 33, Ostrava–Poruba, Czech Republic

    Petr Kovář

Authors
  1. Petr Kovář
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Petr Kovář .

Editor information

Editors and Affiliations

  1. Medizinische Informatik und Technik, Institute for Bioinformatics and Transla, UMIT-Private Universität für Gesundheits, Eduard Wallnöfer-Zentrum 1, Hall in Tirol, A-6060, Austria

    Matthias Dehmer

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Kovář, P. (2011). Decompositions and Factorizations of Complete Graphs. In: Dehmer, M. (eds) Structural Analysis of Complex Networks. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4789-6_7

Download citation

Publish with us

Policies and ethics

Search

Navigation