Abstract
Let K v be the complete graph with v vertices. Let G be a simple graph without isolated vertices. A G-design of order v, denoted by G-GD(v), is a partition of the edges of K v into disjoint subgraphs, each of which is isomorphic to G. In this paper, we will completely solve the existence problem of graph designs for a nine-edge six-vertex graph.
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)
Colbourn, C.J., Dinitz, J.H.: The CRC Handbook of Combinatorial Designs, 2nd edn. Chapman and Hall/CRC, Boca Raton FL (2007)
Harary, F.: Graph Theory. Addison-Wesley, New York (1969)
Ma, C.P.: The graph designs for six graphs with six vertices and nine edges. Master thesis, Hebei Normal University (2004)
Kang, Q.D., Zhao, H.T., Ma, C.P.: Graph designs for nine graphs with six vertices and nine edges. Ars Combin. 88, 33–49 (2008)
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
Liu, H., Wang, L. (2011). Completing the Spectrum for a Class of Graph Designs. 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_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-25002-6_3
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)