Distance-regular graphs with intersection arrays {52, 35, 16; 1, 4, 28} and {69, 48, 24; 1, 4, 46} do not exist
Abstract
Distance-regular graph; Intersection array; Terwilliger graph
Publication Title
Designs Codes and Cryptography
Recommended Citation
Gavrilyuk, A., & Makhnev, A. (2012). Distance-regular graphs with intersection arrays {52, 35, 16; 1, 4, 28} and {69, 48, 24; 1, 4, 46} do not exist. Designs Codes and Cryptography, 65 (1-2), 49-54. https://doi.org/10.1007/s10623-012-9695-1
COinS
