论文信息 - Distance-regular graphs with intersection arrays {52, 35, 16; 1, 4, 28} and {69, 48, 24; 1, 4, 46} do not exist

Distance-regular graphs with intersection arrays {52, 35, 16; 1, 4, 28} and {69, 48, 24; 1, 4, 46} do not exist

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.

Alexander L. Gavrilyuk | Alexander A. Makhnev

[1] P. Delsarte. AN ALGEBRAIC APPROACH TO THE ASSOCIATION SCHEMES OF CODING THEORY , 2011 .

[2] A. Hora,et al. Distance-Regular Graphs , 2007 .

[3] Jacobus H. Koolen,et al. Shilla distance-regular graphs , 2009, Eur. J. Comb..

[4] Alexander L. Gavrilyuk. On the Koolen-Park inequality and Terwilliger graphs , 2010, Electron. J. Comb..

[5] Distance-regular graphs with intersection arrays {55, 36, 11; 1, 4, 45} and {56, 36, 9; 1, 3, 48} do not exist , 2011 .