EUVIMEDEUVIMED entdecken
Crossref

Strongly regular graphs decomposable into a divisible design graph and a Delsarte clique

Alexander L. Gavrilyuk, Vladislav V. Kabanov

Designs, Codes and Cryptography · 2025-06 · 93 (6) · 2177-2189

DOI: 10.1007/s10623-024-01563-y ↗

Kurz gefasst

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

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Japan Society for the Promotion of Science

Zitieren

APA

Gavrilyuk, A. L., & Kabanov, V. V. (2025). Strongly regular graphs decomposable into a divisible design graph and a Delsarte clique. Designs, Codes and Cryptography, 93(6), 2177-2189. https://doi.org/10.1007/s10623-024-01563-y

Vancouver

Gavrilyuk AL, Kabanov VV. Strongly regular graphs decomposable into a divisible design graph and a Delsarte clique. Designs, Codes and Cryptography. 2025;93(6):2177-2189. doi:10.1007/s10623-024-01563-y

BibTeX
@article{Gavrilyuk2025,
  author = {Gavrilyuk, Alexander L. and Kabanov, Vladislav V.},
  title = {Strongly regular graphs decomposable into a divisible design graph and a Delsarte clique},
  journal = {Designs, Codes and Cryptography},
  year = {2025},
  volume = {93},
  number = {6},
  pages = {2177--2189},
  doi = {10.1007/s10623-024-01563-y}
}
Kostenlos starten →