id: 06062570
dt: j
an: 06062570
au: Gavrilyuk, Alexander L.; Makhnev, Alexander A.
ti: Distance-regular graphs with intersection arrays $\{52, 35, 16; 1, 4, 28\}$
    and $\{69, 48, 24; 1, 4, 46\}$ do not exist.
so: Des. Codes Cryptography 65, No. 1-2, 49-54 (2012).
py: 2012
pu: Springer, Norwell, MA
la: EN
cc: 
ut: distance-regular graph; intersection array; Terwilliger graph
ci: 
li: doi:10.1007/s10623-012-9695-1
ab: Summary: We prove that the arrays $\{52, 35, 16; 1, 4, 28\}$ and $\{69, 48,
    24; 1, 4, 46\}$ cannot be realized as the intersection arrays of
    distance-regular graphs. In the proof we use some inequalities bounding
    the size of substructures (cliques, cocliques) in a distance-regular
    graph.
rv: