Fetching the paper…

Reading the bibliography…

2009

A characterization of Q-polynomial distance-regular graphs

Jurisic, Aleksandar, Terwilliger, Paul, Zitnik, Arjana

Original
PDF
Post on X

Understand

We obtain the following characterization of $Q$-polynomial distance-regular graphs.

Let $\G$ denote a distance-regular graph with diameter $d\ge 3$.
Let $E$ denote a minimal idempotent of $\G$ which is not the trivial idempotent $E_0$.
Let $\{\theta_i^*\}_{i=0}^d$ denote the dual eigenvalue sequence for $E$.

A characterization of Q-polynomial distance-regular graphs · Around

Built on

P. Delsarte, An algebraic approach to the association schemes of coding theory,
1973
Earlier work this paper cites.
D. A. Leonard, Orthogonal polynomials, duality and association schemes,
1982
Earlier work this paper cites.
Bannai, E. and T. Ito,
1984
Earlier work this paper cites.
A. E. Brouwer, A. M. Cohen and A. Neumaier,
1989
Earlier work this paper cites.

Similar

P. Terwilliger, The subconstituent algebra of an association scheme, I.,
1992
Cited alongside, same era.
P. Terwilliger, The subconstituent algebra of an association scheme, III.,
1993
Cited alongside, same era.
P. Terwilliger, A new inequality for distance-regular graphs,
1995
Cited alongside, same era.
A. Jurišić, J. Koolen and P. Terwilliger, Tight distance-regular graphs,
2000
Cited alongside, same era.

Then

M. S. Lang, Tails of bipartite distance-regular graphs,
2002
Later among the works it cites.
M. S. Lang, A new inequality for bipartite distance-regular graphs,
2004
Later among the works it cites.
A. A. Pascasio, A characterization of
2008
Later among the works it cites.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…