对称矩阵结合方案中关系图的连通性

Connectivity of Relation Graph in Association Schemes of Symmetric Matrices

设IFq是q个元的域,q是2的幂,S(n,q)是IFq上n×n对称矩阵所成的集合.本文给出了以X=S(n,q)为有限集的两种对称矩阵结合方案,分别讨论了这两种结合方案中结合关系R1和R1的关系图Γ(1)和Γ(1)的连通性.

Let IFq be the finite fiteld with q, q is a power of 2, and S（n, q） be a set of n×n symmetric matrices. In this paper two association schemes of the symmetric matrices with finite set X = S（n, q） be given, and the connectivity of relation graphs Г1 and of two association relation R1 and, respectively, in these association schemes be discussed.