DOIAbstract
AbstractThree inequalities between intersection numbers of a distance-regular graph will be given. We apply these inequalities on distance-regular graphs with large ai, where ai denotes the usual intersection number
AbstractThree inequalities between intersection numbers of a distance-regular graph will be given. We apply these inequalities on distance-regular graphs with large ai, where ai denotes the usual intersection number
Let be a distance regular graph with intersection array b 0, b 1,..., b d–1; c 1,..., c d. It is sho...
Let be a distance regular graph with intersection array b 0, b 1,..., b d–1; c 1,..., c d. It is sho...
Let be a distance regular graph with intersection array b 0, b 1,..., b d–1; c 1,..., c d. It is sho...
AbstractThree inequalities between intersection numbers of a distance-regular graph will be given. W...
AbstractLet ai, bi, and ci be the usual intersection numbers of a distance-regular graph. Inequaliti...
AbstractLet ai, bi, and ci be the usual intersection numbers of a distance-regular graph. Inequaliti...
DoctorFor any two vertices x, y of a distance-regular graph, say at distance h, there are ph ij(x, y...
AbstractWe show several inequalities for intersection numbers of distance-regular graphs. As an appl...
We prove that the arrays {52, 35, 16; 1, 4, 28} and {69, 48, 24; 1, 4, 46} cannot be realized as the...
We give an inequality on the parameters of distance regular graphs, and show the geometric consequen...
We give an inequality on the parameters of distance regular graphs, and show the geometric consequen...
We give an inequality on the parameters of distance regular graphs, and show the geometric consequen...
We give an inequality on the parameters of distance regular graphs, and show the geometric consequen...
Let be a distance regular graph with intersection array b 0, b 1,..., b d–1; c 1,..., c d. It is sho...
Let be a distance regular graph with intersection array b 0, b 1,..., b d–1; c 1,..., c d. It is sho...
Let be a distance regular graph with intersection array b 0, b 1,..., b d–1; c 1,..., c d. It is sho...
Let be a distance regular graph with intersection array b 0, b 1,..., b d–1; c 1,..., c d. It is sho...
Let be a distance regular graph with intersection array b 0, b 1,..., b d–1; c 1,..., c d. It is sho...
AbstractThree inequalities between intersection numbers of a distance-regular graph will be given. W...
AbstractLet ai, bi, and ci be the usual intersection numbers of a distance-regular graph. Inequaliti...
AbstractLet ai, bi, and ci be the usual intersection numbers of a distance-regular graph. Inequaliti...
DoctorFor any two vertices x, y of a distance-regular graph, say at distance h, there are ph ij(x, y...
AbstractWe show several inequalities for intersection numbers of distance-regular graphs. As an appl...
We prove that the arrays {52, 35, 16; 1, 4, 28} and {69, 48, 24; 1, 4, 46} cannot be realized as the...
We give an inequality on the parameters of distance regular graphs, and show the geometric consequen...
We give an inequality on the parameters of distance regular graphs, and show the geometric consequen...
We give an inequality on the parameters of distance regular graphs, and show the geometric consequen...
We give an inequality on the parameters of distance regular graphs, and show the geometric consequen...
Let be a distance regular graph with intersection array b 0, b 1,..., b d–1; c 1,..., c d. It is sho...
Let be a distance regular graph with intersection array b 0, b 1,..., b d–1; c 1,..., c d. It is sho...
Let be a distance regular graph with intersection array b 0, b 1,..., b d–1; c 1,..., c d. It is sho...
Let be a distance regular graph with intersection array b 0, b 1,..., b d–1; c 1,..., c d. It is sho...
Let be a distance regular graph with intersection array b 0, b 1,..., b d–1; c 1,..., c d. It is sho...
Add to ORKG