G-Design of Complete Multipartite Graph Where G Is Five Points-Six Edges ()
Abstract
In this paper, we construct G-designs of complete multipartite graph, where G is five points-six edges.
Share and Cite:
C. Gu and W. Zhou, "
G-Design of Complete Multipartite Graph Where
G Is Five Points-Six Edges,"
Advances in Pure Mathematics, Vol. 2 No. 4, 2012, pp. 301-303. doi:
10.4236/apm.2012.24040.
Conflicts of Interest
The authors declare no conflicts of interest.
References
|
[1]
|
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
|
|
[2]
|
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.
|
|
[3]
|
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
|
|
[4]
|
J. A. Bondy and U. S. R. Murty, “Graph Theory with Applications,” Macmillan Press, London, 1976.
|
|
[5]
|
C. J Colbourn and J. H. Dinitz, “The CRC Handbook of Combinatorial Designs,” CRC Press Inc., Boca Raton, 1996. doi:10.1201/9781420049954
|