AbstractA theorem of D. Leonard, as it appears in Bannai and Ito (Benjamin-Cummings Lecture Note Series, No. 58, Menlo Park, Ca., 1984), says the intersection numbers of distance-regular graphs with the Q-polynomial property take seven possible forms, called 1, 1A, 2, 2A, 2B, 2C, and 3. In this paper we show the known list of examples of type 3 is complete
AbstractWe use the system of linear Diophantine equations introduced by Coolsaet and Jurišić to obta...
AbstractIt is shown that for any distance-regular graph Γ with c2 = 2, c3 = 3, and a2 = 2a1 (a1 ≠ 2)...
AbstractLet Γ denote a Q-polynomial distance-regular graph with diameter d⩾3. We show that if the va...
AbstractA theorem of D. Leonard, as it appears in Bannai and Ito (Benjamin-Cummings Lecture Note Ser...
AbstractWe consider a class of distance-regular graphs Γ with diameter d whose intersection numbers ...
AbstractWe consider a class of distance-regular graphs Γ with diameter d whose intersection numbers ...
AbstractLet Γ denote a bipartite distance-regular graph with diameter D≥3. Fix any vertex x and let ...
AbstractLet Γ denote a distance-regular graph with classical parameters (d, b, α, β). Suppose that t...
AbstractLet Γ denote a bipartite distance-regular graph with diameter D≥3. Fix any vertex x and let ...
AbstractLet Γ denote a Q-polynomial distance-regular graph with diameter d⩾3. We show that if the va...
In 1984 Bannai and Ito conjectured that there are finitely many distance-regular graphs with fixed v...
AbstractIn 1984 Bannai and Ito conjectured that there are finitely many distance-regular graphs with...
In 1984 Bannai and Ito conjectured that there are finitely many distance-regular graphs with fixed v...
AbstractLetΓbe a distance-regular graph of diameter at least three. SupposeΓis Q-polynomial with res...
AbstractIt is shown that the number of columns of type (1, 1, k − 2) in the intersection array of a ...
AbstractWe use the system of linear Diophantine equations introduced by Coolsaet and Jurišić to obta...
AbstractIt is shown that for any distance-regular graph Γ with c2 = 2, c3 = 3, and a2 = 2a1 (a1 ≠ 2)...
AbstractLet Γ denote a Q-polynomial distance-regular graph with diameter d⩾3. We show that if the va...
AbstractA theorem of D. Leonard, as it appears in Bannai and Ito (Benjamin-Cummings Lecture Note Ser...
AbstractWe consider a class of distance-regular graphs Γ with diameter d whose intersection numbers ...
AbstractWe consider a class of distance-regular graphs Γ with diameter d whose intersection numbers ...
AbstractLet Γ denote a bipartite distance-regular graph with diameter D≥3. Fix any vertex x and let ...
AbstractLet Γ denote a distance-regular graph with classical parameters (d, b, α, β). Suppose that t...
AbstractLet Γ denote a bipartite distance-regular graph with diameter D≥3. Fix any vertex x and let ...
AbstractLet Γ denote a Q-polynomial distance-regular graph with diameter d⩾3. We show that if the va...
In 1984 Bannai and Ito conjectured that there are finitely many distance-regular graphs with fixed v...
AbstractIn 1984 Bannai and Ito conjectured that there are finitely many distance-regular graphs with...
In 1984 Bannai and Ito conjectured that there are finitely many distance-regular graphs with fixed v...
AbstractLetΓbe a distance-regular graph of diameter at least three. SupposeΓis Q-polynomial with res...
AbstractIt is shown that the number of columns of type (1, 1, k − 2) in the intersection array of a ...
AbstractWe use the system of linear Diophantine equations introduced by Coolsaet and Jurišić to obta...
AbstractIt is shown that for any distance-regular graph Γ with c2 = 2, c3 = 3, and a2 = 2a1 (a1 ≠ 2)...
AbstractLet Γ denote a Q-polynomial distance-regular graph with diameter d⩾3. We show that if the va...
DOI
Add to ORKG