Skip to main content
Erschienen in: Designs, Codes and Cryptography 2/2015

01.05.2015

4-Cycle decompositions of \(( \lambda +m)K_{v+u} {\setminus } \lambda K_v\)

verfasst von: N. A. Newman

Erschienen in: Designs, Codes and Cryptography | Ausgabe 2/2015

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper we solve the problem of decomposing \(( \lambda +m)K_{v+u} {\setminus } \lambda K_v\) into 4-cycles for all \(m>0\) and \(u \ge 1\). This paper extends the results of “Enclosings of \(\lambda \)-fold 4-cycle systems” [Newman and Rodger, Des. Codes Cryptogr. 55:297–310 (2010)].
Literatur
1.
Zurück zum Zitat Andersen L.D., Hilton A.J.W., Mendelsohn E.: Embedding partial Steiner triple systems. Proc. Lond. Math. Soc. 41, 557–576 (1980). Andersen L.D., Hilton A.J.W., Mendelsohn E.: Embedding partial Steiner triple systems. Proc. Lond. Math. Soc. 41, 557–576 (1980).
2.
Zurück zum Zitat Bermond J.-C., Huang C., Sotteau D.: Balanced cycle and circuit designs: even cases. Ars Comb. 5, 292–318 (1978). Bermond J.-C., Huang C., Sotteau D.: Balanced cycle and circuit designs: even cases. Ars Comb. 5, 292–318 (1978).
3.
Zurück zum Zitat Billington E.J., Fu H., Rodger C.A.: Packing complete multipartite graphs with 4-cycles. J. Comb. Des. 9, 107–127 (2001). Billington E.J., Fu H., Rodger C.A.: Packing complete multipartite graphs with 4-cycles. J. Comb. Des. 9, 107–127 (2001).
4.
Zurück zum Zitat Bryant D.E., Rodger C.A.: The Doyen–Wilson theorem extended to \(5\)-cycle. J. Comb. Theory 68, 218–225 (1994). Bryant D.E., Rodger C.A.: The Doyen–Wilson theorem extended to \(5\)-cycle. J. Comb. Theory 68, 218–225 (1994).
5.
Zurück zum Zitat Bryant D.E., Rodger C.A.: On the Doyen–Wilson theorem for \(m\)-cycle systems. J. Comb. Des. 4, 253–271 (1994). Bryant D.E., Rodger C.A.: On the Doyen–Wilson theorem for \(m\)-cycle systems. J. Comb. Des. 4, 253–271 (1994).
6.
Zurück zum Zitat Bryant D.E., Rodger C.A., Spicer E.R.: Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m \le 14\). Discret. Math. 171, 55–75 (1997). Bryant D.E., Rodger C.A., Spicer E.R.: Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m \le 14\). Discret. Math. 171, 55–75 (1997).
7.
Zurück zum Zitat Bryant D., Horsley D., Maenhaut B.: Decompositions into 2-regular subgraphs and equitable partial cycle decompositions. J. Combin. Theory Ser. B 93, 67–72 (2005). Bryant D., Horsley D., Maenhaut B.: Decompositions into 2-regular subgraphs and equitable partial cycle decompositions. J. Combin. Theory Ser. B 93, 67–72 (2005).
8.
Zurück zum Zitat Colbourn C.J., Hamm R.C., Rosa A.: Embedding, immersing, and enclosing. In: Proceedings of the Sixteenth Southeastern International Conference on Combinatorics, Graph Theory and Computing. Congressus Numerantium, vol. 47, pp. 229–236. Boca Raton (1985). Colbourn C.J., Hamm R.C., Rosa A.: Embedding, immersing, and enclosing. In: Proceedings of the Sixteenth Southeastern International Conference on Combinatorics, Graph Theory and Computing. Congressus Numerantium, vol. 47, pp. 229–236. Boca Raton (1985).
9.
Zurück zum Zitat Doyen J., Wilson R.M.: Embeddings of Steiner triple systems. Discret. Math. 5, 229–239 (1973). Doyen J., Wilson R.M.: Embeddings of Steiner triple systems. Discret. Math. 5, 229–239 (1973).
10.
Zurück zum Zitat Fu H.L., Rodger C.A.: Group divisible designs with two associate classes: \(n=2\) or \(m=2\). J. Comb. Theory Ser. A 83, 94–117 (1998). Fu H.L., Rodger C.A.: Group divisible designs with two associate classes: \(n=2\) or \(m=2\). J. Comb. Theory Ser. A 83, 94–117 (1998).
11.
Zurück zum Zitat Lindner C.C., Rodger C.A.: Design Theory. CRC Press, Boca Raton (1997). Lindner C.C., Rodger C.A.: Design Theory. CRC Press, Boca Raton (1997).
12.
Zurück zum Zitat Newman N.A., Rodger C.A.: Enclosings of \(\lambda \)-fold 4-cycle systems. Des. Codes Cryptogr. 55, 297–310 (2010). Newman N.A., Rodger C.A.: Enclosings of \(\lambda \)-fold 4-cycle systems. Des. Codes Cryptogr. 55, 297–310 (2010).
13.
Zurück zum Zitat Newman N.A., Rodger C.A.: Enclosings of \(\lambda \)-fold triple systems. Util. Math. (in press). Newman N.A., Rodger C.A.: Enclosings of \(\lambda \)-fold triple systems. Util. Math. (in press).
14.
Zurück zum Zitat Raines M.E., Szaniszló Z.: Equitable partial cycle systems. Australas. J. Comb. 19, 149–156 (1999). Raines M.E., Szaniszló Z.: Equitable partial cycle systems. Australas. J. Comb. 19, 149–156 (1999).
15.
Zurück zum Zitat Sotteau D.: Decompositions of \(K_{m, n}(K_{m, n}^{*})\) into cycles of length \(2k\). J. Comb. Theory Ser. B 30, 75–81 (1981). Sotteau D.: Decompositions of \(K_{m, n}(K_{m, n}^{*})\) into cycles of length \(2k\). J. Comb. Theory Ser. B 30, 75–81 (1981).
16.
Zurück zum Zitat West D.B.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (2001). West D.B.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (2001).
Metadaten
Titel
4-Cycle decompositions of
verfasst von
N. A. Newman
Publikationsdatum
01.05.2015
Verlag
Springer US
Erschienen in
Designs, Codes and Cryptography / Ausgabe 2/2015
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-013-9904-6

Weitere Artikel der Ausgabe 2/2015

Designs, Codes and Cryptography 2/2015 Zur Ausgabe

Premium Partner