Crossref
Divisible design graphs from the symplectic graph
Designs, Codes and Cryptography · 2025-05 · 93 (5) · 1401-1424
DOI: 10.1007/s10623-024-01557-w ↗Kurz gefasst
Fachartikel in der Zeitschrift Designs, Codes and Cryptography, online erschienen am 29.12.2024. Verfasst von Bart De Bruyn und 3 weiteren Autor:innen. Die Arbeit wurde bisher 8-mal zitiert (Crossref) und nennt 32 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Bruyn, B. D., Goryainov, S., Haemers, W. H., & Shalaginov, L. (2025). Divisible design graphs from the symplectic graph. Designs, Codes and Cryptography, 93(5), 1401-1424. https://doi.org/10.1007/s10623-024-01557-w
Vancouver
Bruyn BD, Goryainov S, Haemers WH, Shalaginov L. Divisible design graphs from the symplectic graph. Designs, Codes and Cryptography. 2025;93(5):1401-1424. doi:10.1007/s10623-024-01557-w
BibTeX
@article{Bruyn2025,
author = {Bruyn, Bart De and Goryainov, Sergey and Haemers, Willem H. and Shalaginov, Leonid},
title = {Divisible design graphs from the symplectic graph},
journal = {Designs, Codes and Cryptography},
year = {2025},
volume = {93},
number = {5},
pages = {1401--1424},
doi = {10.1007/s10623-024-01557-w}
}
EUVIMED