@article{oai:aue.repo.nii.ac.jp:00006127,
 author = {Nozaki, Hiroshi},
 issue = {2},
 journal = {Annals of Combinatorics},
 month = {Jun},
 note = {text, In this paper we characterize “large” regular graphs using certain entries in the projection matrices onto the eigenspaces of the graph. As a corollary of this result, we show that “large” association schemes become P-polynomial association schemes. Our results are summarized as follows. Let G = (V, E) be a connected k-regular graph with d+1 distinct eigenvalues k=θ_0 >θ_1 >⋯>θ_d. Since the diameter of G is at most d, we have the Moore bound |V|≤M(k,d)=1+k∑^^<d−1>__<i=0>(k−1)^i. Note that if |V| > M(k, d−1) holds, the diameter of G is equal to d. Let E_i be the orthogonal projection matrix onto the eigenspace corresponding to θ_i. Let ∂(u, v) be the path distance of u, v ∈V.},
 pages = {379--386},
 title = {Polynomial properties on large symmetric association schemes},
 volume = {20},
 year = {2016}
}