Abstract
Let K v be the complete graph with v vertices. A G-design of K v , denoted by G-GD(v), is a partition of K v into subgraphs so that each subgraph is isomorphic to G. In this paper, we will discuss the graph designs of one graph with six vertices and nine edges, and prove that there exists a G 12-GD(v) when v ≡ 0 (mod 9) and v ≥ 9, except for v = 9 and except possibly for v = 81.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adams, P., Bryant, D., Buchanan, M.: A survey on the existence of G-Designs. J. Combin. Des. 16, 373–410 (2008)
Harary, F.: Graph Theory. Addison-Wesley, New York (1969)
Colbourn, C.J., Dinitz, J.H. (eds.): CRC Handbook of Combinatorial Designs, 2nd edn. Chapman and Hall/CRC, Boca Raton, FL (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gao, Q. (2011). Graph Design of a Graph with Six Vertices and Nine Edges. In: Wu, Y. (eds) High Performance Networking, Computing, and Communication Systems. ICHCC 2011. Communications in Computer and Information Science, vol 163. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25002-6_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-25002-6_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25001-9
Online ISBN: 978-3-642-25002-6
eBook Packages: Computer ScienceComputer Science (R0)