Research ArticleOpen AccessGoogle Scholar indexed
<i>G</i>-Design of Complete Multipartite Graph Where <i>G</i> Is Five Points-Six Edges
School of Mathematical Sciences, Huaiyin Normal University, Huai’an, China
School of Mathematical Sciences, Huaiyin Normal University, Huai’an, China
- 1 School of Mathematical Sciences, Huaiyin Normal University, Huai’an, China
- 2 School of Mathematical Sciences, Huaiyin Normal University, Huai’an, China
Advances in Pure Mathematics·Volume 02 (2012)·Pages 301–303·Published 30 July 2012·DOI10.4236/apm.2012.24040
Copy link · social · email
Abstract
In this paper, we construct G -designs of complete multipartite graph, where G is five points-six edges.
KeywordsComplete Multipartite GraphGraph DesignLatin Square
- J. C. Bermond and M. J Schonhei, “G-Decomposition of Kn, Where G Has Four Vertices or Less,” Discrete Mathematics, Vol. 19, No. 2, 1997, pp. 113-120. doi:10.1016/0012-365X(77)90027-9
- J. C. Bermond, C. Huang, A. Rosa, et al., “Decomposition of Complete Graphs into Isomorphic Sutgraphs with Five Vertices,” Ars Combinatoria, Vol. 10, 1980, pp. 293-318.
- K. Ushio, “G-Designs and Related Designs,” Discrete Mathematics, Vol. 116, No. 1-3, 1993, pp. 299-311. doi:10.1016/0012-365X(93)90408-L
- J. A. Bondy and U. S. R. Murty, “Graph Theory with Applications,” Macmillan Press, London, 1976.
- C. J Colbourn and J. H. Dinitz, “The CRC Handbook of Combinatorial Designs,” CRC Press Inc., Boca Raton, 1996. doi:10.1201/9781420049954