A new inequality for distance-regular graphs
P Terwilliger - Discrete Mathematics, 1995 - Elsevier
Given a nontrivial primitive idempotent E of a distance-regular graph Γ with diameter d⩾ 3,
we obtain an inequality involving the intersection numbers of Γ for each integer i (3⩽ i⩽ d) …
we obtain an inequality involving the intersection numbers of Γ for each integer i (3⩽ i⩽ d) …
A new inequality for distance-regular graphs
P Terwilliger - Discrete Mathematics, 1995 - infona.pl
Given a nontrivial primitive idempotent E of a distance-regular graph Γ with diameter d⩾ 3,
we obtain an inequality involving the intersection numbers of Γ for each integer i (3⩽ i⩽ d) …
we obtain an inequality involving the intersection numbers of Γ for each integer i (3⩽ i⩽ d) …
A new inequality for distance-regular graphs
P Terwilliger - Discrete Mathematics, 1995 - dl.acm.org
Given a nontrivial primitive idempotent E of a distance-regular graph with diameter d 3, we
obtain an inequality involving the intersection numbers of for each integer i (3 id). We show …
obtain an inequality involving the intersection numbers of for each integer i (3 id). We show …
A new inequality for distance-regular graphs
P Terwilliger - Discrete Mathematics, 1995 - elibrary.ru
Given a nontrivial primitive idempotent E of a distance-regular graph Γ with diameter d>= 3,
we obtain an inequality involving the intersection numbers of Γ for each integer i (3=< i=< d) …
we obtain an inequality involving the intersection numbers of Γ for each integer i (3=< i=< d) …