most citedOn a Koolen -- Park inequality and Terwilliger graphs

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2010

There exists no distance-regular graph with intersection array {56,36,9;1,3,48}

Alexander L. Gavrilyuk

We prove that a distance-regular graph with intersection array {56,36,9;1,3,48} does not exist. This intersection array is from the table of feasible parameters for distance-regula…

math.CO2010

There exists no distance-regular graph with intersection array {55,36,11;1,4,45}

Alexander L. Gavrilyuk

We prove that a distance-regular graph with intersection array does not exist. This intersection array is from the table of feasible parameters for distance-r…

math.CO2010★ 1 cited

On a Koolen -- Park inequality and Terwilliger graphs

Alexander Gavrilyuk

J.H. Koolen and J. Park have proved a lower bound for intersection number of a distance-regular graph . Moreover, they showed that the graph which attains the equality…