Skip to main content
Top

2024 | OriginalPaper | Chapter

On Decompositions of the Johnson Graph

Authors : Atif Abueida, Mike Daven

Published in: Combinatorics, Graph Theory and Computing

Publisher: Springer Nature Switzerland

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Most of the results on graph decompositions involve a partition of the edges of the complete graph, complete bipartite graph, or complete multipartite graph into disjoint copies of one or more small graphs. In this chapter we find conditions for the decompositions of the Johnson graph into a variety of smaller subgraphs including cycles, path, and other common subgraphs.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference A. Abueida and M. Daven, Multidesigns for graph-pairs on 4 and 5 vertices, Graphs & Combin., 19(4) (2003), 433–447.MathSciNetCrossRef A. Abueida and M. Daven, Multidesigns for graph-pairs on 4 and 5 vertices, Graphs & Combin., 19(4) (2003), 433–447.MathSciNetCrossRef
2.
go back to reference A. Abueida and M. Daven, Multidecompositions of the complete graph, Ars Combin. 72 (2004), 17–22.MathSciNet A. Abueida and M. Daven, Multidecompositions of the complete graph, Ars Combin. 72 (2004), 17–22.MathSciNet
3.
go back to reference A. Abueida and M. Daven, Decomposition of the Johnson Graphs into Graph-Pairs of Order 4, \(52^{nd}\) Southeastern International Conference on Combinatorics, Graph Theory and Computing 2021, Springer Proceedings in Mathematics and Statistics, 448 (2024), 65–71. A. Abueida and M. Daven, Decomposition of the Johnson Graphs into Graph-Pairs of Order 4, \(52^{nd}\) Southeastern International Conference on Combinatorics, Graph Theory and Computing 2021, Springer Proceedings in Mathematics and Statistics, 448 (2024), 65–71.
4.
go back to reference A. Abueida and C. Lian, On the decompositions of complete graphs into cycles and stars on the same number of edges, Discuss. Math. Graph Theory, 34 (2014), 113–125.MathSciNetCrossRef A. Abueida and C. Lian, On the decompositions of complete graphs into cycles and stars on the same number of edges, Discuss. Math. Graph Theory, 34 (2014), 113–125.MathSciNetCrossRef
5.
go back to reference P. Adams, D. Bryant, and M. Buchanan, A survey on the existence of G-designs, J. Combin. Des. 16, 373–410 (2008).MathSciNetCrossRef P. Adams, D. Bryant, and M. Buchanan, A survey on the existence of G-designs, J. Combin. Des. 16, 373–410 (2008).MathSciNetCrossRef
6.
go back to reference B. Alspach and H. Gavlas, Cycle decompositions of \(K_n\) and \(K_n-I\), J. Combin. Theory Ser. B 81 (2001), no. 1, 77–99. B. Alspach and H. Gavlas, Cycle decompositions of \(K_n\) and \(K_n-I\), J. Combin. Theory Ser. B 81 (2001), no. 1, 77–99.
7.
go back to reference L.D. Andersen, Factorizations of graphs. In: C. Colbourn and J. Dinitz (eds.), The CRC Handbook of Combinatorial Designs, CRC Press, Boca Raton (1996). L.D. Andersen, Factorizations of graphs. In: C. Colbourn and J. Dinitz (eds.), The CRC Handbook of Combinatorial Designs, CRC Press, Boca Raton (1996).
8.
go back to reference J. Bosák: Decomposition of graphs, Kluwer Academic Publishers, Boston (1990). J. Bosák: Decomposition of graphs, Kluwer Academic Publishers, Boston (1990).
9.
go back to reference M.C. Cuaresma, M. Giudici, and C.E. Praeger, Homogeneous factorisations of Johnson graphs. Des. Codes Cryptogr., 46 (2008), no. 3, 303–327.MathSciNetCrossRef M.C. Cuaresma, M. Giudici, and C.E. Praeger, Homogeneous factorisations of Johnson graphs. Des. Codes Cryptogr., 46 (2008), no. 3, 303–327.MathSciNetCrossRef
10.
go back to reference A. Devillers, M. Giudici, C.H. Li, and C.E. Praeger, Primitive decompositions of Johnson graphs, J. Combin. Theory Ser. A, 115 (2008), no. 6, 925–966.MathSciNetCrossRef A. Devillers, M. Giudici, C.H. Li, and C.E. Praeger, Primitive decompositions of Johnson graphs, J. Combin. Theory Ser. A, 115 (2008), no. 6, 925–966.MathSciNetCrossRef
11.
go back to reference S. Jeevadoss and A. Muthusamy, Decomposition of complete bipartite graphs into paths and cycles, Discrete Math., 331 (2014), 98–108.MathSciNetCrossRef S. Jeevadoss and A. Muthusamy, Decomposition of complete bipartite graphs into paths and cycles, Discrete Math., 331 (2014), 98–108.MathSciNetCrossRef
12.
go back to reference H.-C. Lee and Z.C. Chen, Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars. Discuss. Math. Graph Theory, 40 (2020), no. 3, 823–839.MathSciNetCrossRef H.-C. Lee and Z.C. Chen, Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars. Discuss. Math. Graph Theory, 40 (2020), no. 3, 823–839.MathSciNetCrossRef
13.
go back to reference C.C. Lindner and C.A. Rodger: Design theory, CRC Press, Boca Raton (1997). C.C. Lindner and C.A. Rodger: Design theory, CRC Press, Boca Raton (1997).
14.
go back to reference C.C. Lindner and C.A. Rodger, Decompositions into cycles II: cycle systems, in Contemporary design theory: a collection of surveys (edited by J. Dinitz and D. Stinson), John Wiley and Sons, New York (1992), 325–369. C.C. Lindner and C.A. Rodger, Decompositions into cycles II: cycle systems, in Contemporary design theory: a collection of surveys (edited by J. Dinitz and D. Stinson), John Wiley and Sons, New York (1992), 325–369.
15.
go back to reference G. Ringel, Problem 25, in theory of graphs and its applications. In: Proceedings of the Symposium Smolenice, Prague, p. 162 (1963). G. Ringel, Problem 25, in theory of graphs and its applications. In: Proceedings of the Symposium Smolenice, Prague, p. 162 (1963).
16.
go back to reference M. Šajna, On decomposing \(K_n-I\) into cycles of a fixed odd length, Algebraic and topological methods in graph theory, Discrete Math. 244 (2002), no. 1–3, 435–444. M. Šajna, On decomposing \(K_n-I\) into cycles of a fixed odd length, Algebraic and topological methods in graph theory, Discrete Math. 244 (2002), no. 1–3, 435–444.
17.
go back to reference G. Sethuraman and V. Murugan, Decomposition of complete graphs into arbitrary trees. Graphs Combin. 37 (2021), no. 4, 1191–1203.MathSciNetCrossRef G. Sethuraman and V. Murugan, Decomposition of complete graphs into arbitrary trees. Graphs Combin. 37 (2021), no. 4, 1191–1203.MathSciNetCrossRef
18.
19.
go back to reference T.W. Shyu, Decompositions of complete graphs into paths and cycles, Ars Combin. 97 (2010), 257–270.MathSciNet T.W. Shyu, Decompositions of complete graphs into paths and cycles, Ars Combin. 97 (2010), 257–270.MathSciNet
20.
21.
go back to reference T.W. Shyu, Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each. Discuss. Math. Graph Theory 41 (2021), no. 2, 451–468.MathSciNetCrossRef T.W. Shyu, Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each. Discuss. Math. Graph Theory 41 (2021), no. 2, 451–468.MathSciNetCrossRef
22.
go back to reference M. Tarsi, Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs. J. Combin. Theory Ser. A 34(1) (1983), 60–70.MathSciNetCrossRef M. Tarsi, Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs. J. Combin. Theory Ser. A 34(1) (1983), 60–70.MathSciNetCrossRef
Metadata
Title
On Decompositions of the Johnson Graph
Authors
Atif Abueida
Mike Daven
Copyright Year
2024
DOI
https://doi.org/10.1007/978-3-031-62166-6_23

Premium Partner