Abstract
In this paper, we investigate the existence problem of a graph design for a nine-edge six-vertex graph. Using standard recursions and combining with the necessary direct constructions, we give a near solution for the problem.
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
Colbourn, C.J., Ge, G.N., Ling, A.C.H.: Optical grooming with grooming ratio eight. Discrete Applied Math. 157, 2763–2772 (2009)
Adams, P., Bryant, D., Buchanan, M.: A survey on existence of G-Designs. J. Combin. Des. 16, 373–410 (2008)
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
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag GmbH Berlin Heidelberg
About this paper
Cite this paper
Wang, C. (2012). A Graph Design for Nine Graphs with Six Vertices and Nine Edges. In: Zeng, D. (eds) Advances in Computer Science and Engineering. Advances in Intelligent and Soft Computing, vol 141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27948-5_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-27948-5_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27947-8
Online ISBN: 978-3-642-27948-5
eBook Packages: EngineeringEngineering (R0)