Classification of divisible design graphs with at most 39 vertices
Journal of Combinatorial Designs · 2022-04 · 30 (4) · 205-219
DOI: 10.1002/jcd.21818 ↗At a glance
Journal article in Journal of Combinatorial Designs, published online on 2022-01-17. Written by Dmitry Panasenko and 1 co-authors. Cited 10 times so far (Crossref); 8 references. Funded by: Russian Foundation for Basic Research.
Abstract (original language)
A ‐regular graph is called a divisible design graph (DDG) if its vertex set can be partitioned into classes of size , such that two distinct vertices from the same class have exactly common neighbours, and two vertices from different classes have exactly common neighbours. A DDG with , , or is called improper, otherwise it is called proper. We present new constructions of DDGs and, using a computer enumeration algorithm, we find all proper connected DDGs with at most 39 vertices, except for three tuples of parameters: , , and .
Funding
- Russian Foundation for Basic Research
Cite
APA
Panasenko, D., & Shalaginov, L. (2022). Classification of divisible design graphs with at most 39 vertices. Journal of Combinatorial Designs, 30(4), 205-219. https://doi.org/10.1002/jcd.21818
Vancouver
Panasenko D, Shalaginov L. Classification of divisible design graphs with at most 39 vertices. Journal of Combinatorial Designs. 2022;30(4):205-219. doi:10.1002/jcd.21818
BibTeX
@article{Panasenko2022,
author = {Panasenko, Dmitry and Shalaginov, Leonid},
title = {Classification of divisible design graphs with at most 39 vertices},
journal = {Journal of Combinatorial Designs},
year = {2022},
volume = {30},
number = {4},
pages = {205--219},
doi = {10.1002/jcd.21818}
}
EUVIMED