Abstract
Divisible design graphs (DDGs) have been recently defined by Haemers, Kharaghani, and Meulenberg as a generalization of \((v,k,\lambda )\)-graphs. In this paper we define and study divisible design digraphs (DDDs), a directed graph version of DDGs. On the other hand, DDDs are also natural generalization of doubly regular asymmetric digraphs. We obtain necessary conditions for the existence of a DDD with given parameters and give some constructions.
This paper is in final form and no similar paper has been or is being submitted elsewhere.
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
Similar content being viewed by others
References
Beth, T., Jungnickel, D., Lenz, H.: Design Theory, vol. I. Encyclopedia of Mathematics and Its Applications, vol. 69, 2nd edn. Cambridge University Press, Cambridge (1999)
Bose, R.C.: Symmetric group divisible designs with the dual property. J. Stat. Plann. Inference 1(1), 87–101 (1977)
Cameron, P.J., van Lint, J.H.: Designs, Graphs, Codes and Their Links. London Mathematical Society Student Texts, vol. 22. Cambridge University Press, Cambridge (1991)
Colbourn, C.J., Dinitz, J.H. (eds.): Handbook of Combinatorial Designs, 2nd edn. Discrete Mathematics and Its Applications. Chapman & Hall/CRC, Boca Raton (2007)
Crnković, D.: A series of Siamese twin designs. Discret. Math. 309(2), 322–327 (2009)
Crnković, D., Haemers, W.H.: Walk-regular divisible design graphs. Des. Codes Crypt. 72(1), 165–175 (2014)
Haemers, W.H., Kharaghani, H., Meulenberg, M.A.: Divisible design graphs. J. Comb. Theory Ser. A 118(3), 978–992 (2011)
Ionin, Y.J., Kharaghani, H.: Doubly regular digraphs and symmetric designs. J. Comb. Theory Ser. A 101(1), 35–48 (2003)
Ito, N.: On spectra of doubly regular asymmetric digraphs of RH-type. Graphs Combinatorics 5(3), 229–234 (1989)
Ito, N., Raposa, B.P.: Nearly triply regular DRADs of RH type. Graphs Combinatorics 8(2), 143–153 (1992)
Janko, Z., Kharaghani, H.: A block negacyclic Bush-type Hadamard matrix and two strongly regular graphs. J. Comb. Theory Ser. A 98(1), 118–126 (2002)
Kharaghani, H.: New class of weighing matrices. Ars Comb. 19, 69–72 (1985)
Lander, E.S.: Symmetric Designs: An Algebraic Approach. London Mathematical Society Lecture Note Series, vol. 74. Cambridge University Press, Cambridge (1983)
Rudvalis, A.: \((v,\,k,\,\lambda )\)-graphs and polarities of \((v,\,k,\,\lambda )\)-designs. Math. Z. 120, 224–230 (1971)
Tonchev, V.D.: Combinatorial Configurations: Designs, Codes, Graphs. Pitman Monographs and Surveys in Pure and Applied Mathematics, vol. 40. Longman Scientific & Technical/Wiley, Harlow/New York (1988) [Translated from the Bulgarian by Robert A. Melter]
Acknowledgements
This work was started while Crnković was visiting University of Lethbridge. He is grateful for the support and hospitality provided by University of Lethbridge. Crnković also acknowledges the support of the Croatian Science Foundation grant 1637. Kharaghani thanks NSERC for the continuing support of his research.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Crnković, D., Kharaghani, H. (2015). Divisible Design Digraphs. In: Colbourn, C. (eds) Algebraic Design Theory and Hadamard Matrices. Springer Proceedings in Mathematics & Statistics, vol 133. Springer, Cham. https://doi.org/10.1007/978-3-319-17729-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-17729-8_4
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-17728-1
Online ISBN: 978-3-319-17729-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)