Skip to main content
Top

2015 | OriginalPaper | Chapter

Divisible Design Digraphs

Authors : Dean Crnković, Hadi Kharaghani

Published in: Algebraic Design Theory and Hadamard Matrices

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference 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) 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)
3.
go back to reference 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) 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)
4.
go back to reference Colbourn, C.J., Dinitz, J.H. (eds.): Handbook of Combinatorial Designs, 2nd edn. Discrete Mathematics and Its Applications. Chapman & Hall/CRC, Boca Raton (2007)MATH Colbourn, C.J., Dinitz, J.H. (eds.): Handbook of Combinatorial Designs, 2nd edn. Discrete Mathematics and Its Applications. Chapman & Hall/CRC, Boca Raton (2007)MATH
5.
6.
go back to reference Crnković, D., Haemers, W.H.: Walk-regular divisible design graphs. Des. Codes Crypt. 72(1), 165–175 (2014)CrossRefMATH Crnković, D., Haemers, W.H.: Walk-regular divisible design graphs. Des. Codes Crypt. 72(1), 165–175 (2014)CrossRefMATH
9.
go back to reference Ito, N.: On spectra of doubly regular asymmetric digraphs of RH-type. Graphs Combinatorics 5(3), 229–234 (1989)CrossRefMATH Ito, N.: On spectra of doubly regular asymmetric digraphs of RH-type. Graphs Combinatorics 5(3), 229–234 (1989)CrossRefMATH
11.
go back to reference 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)MathSciNetCrossRefMATH 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)MathSciNetCrossRefMATH
13.
go back to reference Lander, E.S.: Symmetric Designs: An Algebraic Approach. London Mathematical Society Lecture Note Series, vol. 74. Cambridge University Press, Cambridge (1983) Lander, E.S.: Symmetric Designs: An Algebraic Approach. London Mathematical Society Lecture Note Series, vol. 74. Cambridge University Press, Cambridge (1983)
14.
go back to reference Rudvalis, A.: \((v,\,k,\,\lambda )\)-graphs and polarities of \((v,\,k,\,\lambda )\)-designs. Math. Z. 120, 224–230 (1971) Rudvalis, A.: \((v,\,k,\,\lambda )\)-graphs and polarities of \((v,\,k,\,\lambda )\)-designs. Math. Z. 120, 224–230 (1971)
15.
go back to reference 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] 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]
Metadata
Title
Divisible Design Digraphs
Authors
Dean Crnković
Hadi Kharaghani
Copyright Year
2015
DOI
https://doi.org/10.1007/978-3-319-17729-8_4

Premium Partner