A note on thin P-polynomial and dual-thin Q-polynomial symmetric association schemes

被引:18
|
作者
Dickie, GA
Terwilliger, PM
机构
[1] Eindhoven Univ Technol, NL-5600 MB Eindhoven, Netherlands
[2] Univ Wisconsin, Dept Math, Madison, WI 53706 USA
关键词
association scheme; distance-regular graph; intersection number; Q-polynomial;
D O I
10.1023/A:1008690026999
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let Y denote a d-class symmetric association scheme, with d greater than or equal to 3. We skew the following: If Y admits a P-polynomial structure with intersection numbers p(ij)(h) and Y is 1-thin with respect to at least one vertex, then p(1l)(l)=0=double right arrow p(1i)(i)=0 1 less than or equal to i less than or equal to d-1 If Y admits a Q-polynomial structure with Krein parameters q(ij)(h), and Y is dual 1-thin with respect to at least one vertex,then q(1l)(l)=0 double right arrow q(1i)(i)=0 1 less than or equal to i less than or equal to d-1.
引用
收藏
页码:5 / 15
页数:11
相关论文
共 50 条