Distance-regular graphs with intersection arrays {52, 35, 16; 1, 4, 28} and {69, 48, 24; 1, 4, 46} do not exist
Tóm tắt
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.
Tài liệu tham khảo
Brouwer A.E., Cohen A.M., Neumaier A.: Distance-Regular Graphs. Springer, Berlin (1989)
Koolen J.H., Park J.: Shilla distance-regular graphs. Eur. J. Comb. 31(8), 2064–2073 (2010)
Gavrilyuk A.L.: Distance-regular graphs with intersection arrays {55,36, 11;1,4,45} and {56,36,9; 1,3,48} do not exist. Doklady Math. 84(1), 444–446 (2011)
Gavrilyuk A.L., Makhnev A.A.: Distance-regular graph with intersection array {45,30,7;1,2,27} does not exist. Discret. Math. Appl. (to appear).
Delsarte P.: An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl. 10 (1973).
Godsil C.D.: Geometric distance-regular covers. N. Z. J. Math. 22, 31–38 (1993)
Gavrilyuk A.L.: On the Koolen-Park inequality and Terwilliger graphs. Electron. J. Comb. 17, R125 (2010)