Abstract
A decomposition of \(\lambda K_n\) into cycles of length k is called a \(\lambda \)-fold k-cycle system of \(\lambda K_n\). A \(\lambda \)-fold k-cycle system of \(\lambda K_n\) is t-simple, \(t<k\), if any two cycles in the decomposition have at most t vertices in common. We denote a t-simple \(\lambda \)-fold k-cycle system of \(\lambda K_n\) by \((n,k,\lambda ,t)\)-cycle system. In this paper, it is shown that an (n, 5, 2, 3)-cycle system exists, for \(n=5r,\ 5r+1\) when (i) \(r\equiv \) 2 or 6 (mod 12) or (ii) \(r\equiv \) 4 or 12 (mod 24).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Billington, E.J., Cavenagh, N.J., Khodkar, A.: Super-simple twofold 4-cycle systems. Bull. ICA 63, 48–50 (2011)
Bluskov, I., Hämäläinen, H.: New upper bounds on the minimum size of covering designs. J. Combin. Des. 6, 21–41 (1998)
Cavenagh, N.J., Billington, E.J.: On decomposing complete tripartite graphs into 5-cycles. Australas. J. Combin. 22, 41–62 (2000)
Chen, K.: On the existence of super-simple \((v,4,3)\)-BIBDs. J. Combin. Math. Combin. Comput. 17, 149–159 (1995)
Chen, K.: On the existence of super-simple \((v,4,4)\)-BIBDs. J. Stat. Plann. Inference 51, 339–350 (1996)
Chen, K., Cao, Z., Wei, R.: Super-simple balanced incomplete block designs with block size 4 and index 6. J. Stat. Plann. Inference 133, 537–554 (2005)
Chen, K., Wei, R.: Super-simple cyclic designs with small values. J. Stat. Plann. Inference 137, 2034–2044 (2007)
Gronau, H.D.O.F., Mullin, R.S.: On super-simple \(2-(v,4,\lambda )\) designs. J. Combin. Math. Combin. Comput. 11, 113–121 (1992)
Hartmann, S.: Superpure digraph designs. J. Combin. Des. 10, 239–255 (2000)
Kim, H.K., Lebedev, V.: On optimal superimposed codes. J. Combin. Des. 12, 79–91 (2004)
Kim, H.K., Lebedev, V., Oh, D.Y.: Some new results on superimposed codes. J. Combin. Des. 13, 276–285 (2005)
Kirkman, T.P.: On a problem in combinatorics. Camb. Dublin Math. J. 2, 191–204 (1847)
Mahmoodian, E.S., Mirzakhani, M.: Decomposition of complete tripartite graphs into 5-cycles. In: 1994 Combinatorics Advances. Mathematics and Its Applications, Tehran, vol. 329, pp. 235–241. Kluwer Academic Publishers, Dordrecht (1995)
Stinson, D.R., Wei, R., Zhu, L.: New constructions for perfect hash families and related structures using combinatorial designs and codes. J. Combin. Des. 8, 189–200 (2000)
Ushio, K.: G-designs and related designs. Discrete Math. 116, 299–311 (1993)
Acknowledgments
The first author thank the University Grants Commission, New Delhi for its financial support (No: 4-4/2014-15 (MRP-SEM/UGC-SERO)) and the second author thank the DST-SERB, New Delhi for its financial support (No. SR/S4/MS: 828/13).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Sangeetha, R., Muthusamy, A. (2017). 3-Simple 2-Fold 5-Cycle Systems. In: Arumugam, S., Bagga, J., Beineke, L., Panda, B. (eds) Theoretical Computer Science and Discrete Mathematics. ICTCSDM 2016. Lecture Notes in Computer Science(), vol 10398. Springer, Cham. https://doi.org/10.1007/978-3-319-64419-6_46
Download citation
DOI: https://doi.org/10.1007/978-3-319-64419-6_46
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-64418-9
Online ISBN: 978-3-319-64419-6
eBook Packages: Computer ScienceComputer Science (R0)