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
A distance-regular graph of diameter d has 2d intersection numbers that determine many properties of...
In this dissertation we study distance-regular graphs. In particular, we look for codes inside them ...
AbstractLet Γ denote a Q-polynomial distance-regular graph with diameter D≥3 and intersection number...
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 ...
AbstractLetΓbe a distance-regular graph of diameter at least three. SupposeΓis Q-polynomial with res...
AbstractLet Γ denote a bipartite distance-regular graph with diameter D≥3. Fix any vertex x and let ...
AbstractWe use the system of linear Diophantine equations introduced by Coolsaet and Jurišić to obta...
AbstractLet Γ denote a bipartite Q-polynomial distance-regular graph with diameter d⩾3, valency k⩾3 ...
AbstractLet Γ denote a Q-polynomial distance-regular graph with diameter d⩾3. We show that if the va...
Abstract. A distance-regular graph of diameter d has 2d intersection numbers that de-terminemany pro...
Abstract. A distance-regular graph of diameter d has 2d intersection numbers that de-terminemany pro...
Let denote a Q-polynomial distance-regular graph with diameter d ¿ 3. We show that if the valency is...
A distance-regular graph of diameter d has 2d intersection numbers that determine many properties of...
A distance-regular graph of diameter d has 2d intersection numbers that determine many properties of...
A distance-regular graph of diameter d has 2d intersection numbers that determine many properties of...
In this dissertation we study distance-regular graphs. In particular, we look for codes inside them ...
AbstractLet Γ denote a Q-polynomial distance-regular graph with diameter D≥3 and intersection number...
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 ...
AbstractLetΓbe a distance-regular graph of diameter at least three. SupposeΓis Q-polynomial with res...
AbstractLet Γ denote a bipartite distance-regular graph with diameter D≥3. Fix any vertex x and let ...
AbstractWe use the system of linear Diophantine equations introduced by Coolsaet and Jurišić to obta...
AbstractLet Γ denote a bipartite Q-polynomial distance-regular graph with diameter d⩾3, valency k⩾3 ...
AbstractLet Γ denote a Q-polynomial distance-regular graph with diameter d⩾3. We show that if the va...
Abstract. A distance-regular graph of diameter d has 2d intersection numbers that de-terminemany pro...
Abstract. A distance-regular graph of diameter d has 2d intersection numbers that de-terminemany pro...
Let denote a Q-polynomial distance-regular graph with diameter d ¿ 3. We show that if the valency is...
A distance-regular graph of diameter d has 2d intersection numbers that determine many properties of...
A distance-regular graph of diameter d has 2d intersection numbers that determine many properties of...
A distance-regular graph of diameter d has 2d intersection numbers that determine many properties of...
In this dissertation we study distance-regular graphs. In particular, we look for codes inside them ...
AbstractLet Γ denote a Q-polynomial distance-regular graph with diameter D≥3 and intersection number...