EUVIMEDEUVIMED entdecken
Crossref

Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique

Alexander L. Gavrilyuk, Vladislav V. Kabanov

Designs, Codes and Cryptography · 2024-05 · 92 (5) · 1379-1391

DOI: 10.1007/s10623-023-01348-9 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Designs, Codes and Cryptography, online erschienen am 29.12.2023. Verfasst von Alexander L. Gavrilyuk und 1 weiteren Autor:innen. Die Arbeit wurde bisher 8-mal zitiert (Crossref) und nennt 35 Literaturangaben. Gefördert von: Japan Society for the Promotion of Science London.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Japan Society for the Promotion of Science London

Zitieren

APA

Gavrilyuk, A. L., & Kabanov, V. V. (2024). Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique. Designs, Codes and Cryptography, 92(5), 1379-1391. https://doi.org/10.1007/s10623-023-01348-9

Vancouver

Gavrilyuk AL, Kabanov VV. Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique. Designs, Codes and Cryptography. 2024;92(5):1379-1391. doi:10.1007/s10623-023-01348-9

BibTeX
@article{Gavrilyuk2024,
  author = {Gavrilyuk, Alexander L. and Kabanov, Vladislav V.},
  title = {Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique},
  journal = {Designs, Codes and Cryptography},
  year = {2024},
  volume = {92},
  number = {5},
  pages = {1379--1391},
  doi = {10.1007/s10623-023-01348-9}
}
Kostenlos starten →