AbstractLet Γ denote a distance-regular graph with diameter d⩾3, and assume Γ is tight in the sense of Jurišić et al. [J. Algebraic Combin. 12 (2000) 163–197]. Let θ denote the second largest or the smallest eigenvalue of Γ. We obtain an inequality involving the first, second and third cosines associated with θ. We investigate the relationship between equality being attained and the existence of dual bipartite Q-polynomial structures on Γ
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 ...
AbstractA new inequality for the parameters of distance-regular graphs is proved. It implies that if...
Let Γ denote a distance-regular graph with diameter d ≥ 3, and assume Γ is tight (in the sense of Ju...
AbstractLet Γ denote a distance-regular graph with diameter d⩾3, and assume Γ is tight in the sense ...
This thesis is an expository work taken from Sections 1-8 of the paper entitled Tight Distance-Regul...
AbstractLet Γ denote a distance-regular graph with diameter d⩾3. Let E, F denote nontrivial primitiv...
This thesis is an expository work taken from Sections 1-8 of the paper entitled Tight Distance-Regul...
AbstractLet Γ denote a distance-regular graph with a strongly closed regular subgraph Y. Hosoya and ...
AbstractLet Γ denote a near polygon distance-regular graph with diameter d≥3, valency k and intersec...
For a distance-regular graph with second largest eigenvalue (resp., smallest eigenvalue) theta(1) (r...
the next section, we will review some definitions and basic concepts. For more background informatio...
Abstract An upper bound is given on the minimum distance between i subsets of the same size of a reg...
AbstractLet Γ denote a distance-regular graph with diameter d⩾3. Let E, F denote nontrivial primitiv...
AbstractFor a distance-regular graph with second largest eigenvalue (resp., smallest eigenvalue) θ1 ...
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 ...
AbstractA new inequality for the parameters of distance-regular graphs is proved. It implies that if...
Let Γ denote a distance-regular graph with diameter d ≥ 3, and assume Γ is tight (in the sense of Ju...
AbstractLet Γ denote a distance-regular graph with diameter d⩾3, and assume Γ is tight in the sense ...
This thesis is an expository work taken from Sections 1-8 of the paper entitled Tight Distance-Regul...
AbstractLet Γ denote a distance-regular graph with diameter d⩾3. Let E, F denote nontrivial primitiv...
This thesis is an expository work taken from Sections 1-8 of the paper entitled Tight Distance-Regul...
AbstractLet Γ denote a distance-regular graph with a strongly closed regular subgraph Y. Hosoya and ...
AbstractLet Γ denote a near polygon distance-regular graph with diameter d≥3, valency k and intersec...
For a distance-regular graph with second largest eigenvalue (resp., smallest eigenvalue) theta(1) (r...
the next section, we will review some definitions and basic concepts. For more background informatio...
Abstract An upper bound is given on the minimum distance between i subsets of the same size of a reg...
AbstractLet Γ denote a distance-regular graph with diameter d⩾3. Let E, F denote nontrivial primitiv...
AbstractFor a distance-regular graph with second largest eigenvalue (resp., smallest eigenvalue) θ1 ...
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 ...
AbstractA new inequality for the parameters of distance-regular graphs is proved. It implies that if...