Skip to main content
SpringerLink
Log in

On Resolvable Multipartite G-Designs II

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

In this paper, it has been proved that and are factorable, where ⊗ denotes wreath product of graphs. As a consequence, a resolvable (k,n,k,2λ) multipartite –design exists for even k. These results generalize the results of Ushio on –factorizations of complete tripartite graphs.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alspach, B., Bermond,J.C., Sotteau,D.: Decomposition into cycles I: Hamilton Decompositions. In: Cycles and Rays (eds. G.Hahn et al.) Kluwer Academic Publishers, (1990), pp 9–18

  2. Bermond, J.C., Sotteau, D.: Graph decompositions and G-designs, (eds. C.St.J.A. Nash-Williams and J.Sheehan) Proc. 5th British Combinatorial Conf. (1995) pp 53–72

  3. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, MacMillan, New York, 1976

  4. Heinrich, K., Langdeau,D., Verrall,H.: Covering 2-paths uniformly. J.Combin. Designs 8, 100–121 (2000)

    Google Scholar 

  5. Hell, P., Rosa, A.: Graph decompositions, handcuffed prisoners and balanced P-designs. Discrete Math. 2, 229–252 (1972)

    Google Scholar 

  6. Muthusamy, A.: On resolvable multipartite G-designs. Graphs and Combinatorics 20, 377–382 (2004)

    Google Scholar 

  7. Muthusamy, A., Paulraja, P.: Factorizations of product graphs into cycles of uniform length. Graphs and Combinatorics 11, 69–90 (1995)

    Google Scholar 

  8. Ushio, K.: G-designs and related designs. Discrete Math. 116, 299–311 (1993)

    Google Scholar 

  9. Ushio, K.: Cycle-factorization of symmetric complete multipartite digraphs. Discrete Math. 199, 273–278 (1999)

    Google Scholar 

  10. Ushio, K.: –factorization of symmetric complete bipartite and tripartite multi-digraphs. Discrete Math. 223, 393–397 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Vellalar College for Women, Erode, 638 009, Tamilnadu, India

    M.G. Karunambigai

  2. Department of Mathematics, Sri Vasavi College, Erode, 638 316, Tamilnadu, India

    A. Muthusamy

Authors
  1. M.G. Karunambigai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Muthusamy
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Karunambigai, M., Muthusamy, A. On Resolvable Multipartite G-Designs II. Graphs and Combinatorics 22, 59–67 (2006). https://doi.org/10.1007/s00373-006-0644-5

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-006-0644-5

Keywords

Search

Navigation