Structures and representations of distance-regular graphs

通过对一个不一定距离正则的图的完全正则码的研究，我得到了一个完全正则团图的概念，并给出了几个证据，证明它在经典距离正则图的分类中起着关键作用。特别地，对薄的完全正则团图的深入研究将意味着薄的q -多项式距离正则图的分类。

Through the investigations of completely regular codes of a graph not necessarily distance-regular, I reached a concept of completely regular clique graphs, and gave several evidence that it plays a key role in a classification of classical distance-regular graphs. In particular, a thorough investigation of thin completely regular clique graphs will imply a classification of thin Q-polynomial distance-regular graphs.