On the p-Rank of the Adjacency Matrices of Strongly Regular Graphs
On the p-Rank of the Adjacency Matrices of Strongly Regular Graphs
复制标题
关于强正则图邻接矩阵的p秩
DOI：
--
复制
发表时间：
1992
期刊：
影响因子：
--
通讯作者：
C. A. V. Eijl
中科院分区：
文献类型：
--
作者：
Andries E. Brouwer;C. A. V. Eijl
设Γ是具有邻接矩阵A的强正则图，I是单位矩阵，J是全1矩阵。设p为素数。我们的目的是研究p-等级(即，超过的等级
$$mathbb{F}_p$$
对于积分a，b，c的矩阵M=aa+bj+ci的有限域)。本文基于van Eijl[8]。
AbstractLet Γ be a strongly regular graph with adjacency matrix A. Let I be the identity matrix, and J the all-1 matrix. Let p be a prime. Our aim is to study the p-rank (that is, the rank over
$$mathbb{F}_p$$
, the finite field with p elements) of the matrices M = aA + bJ + cI for integral a, b, c. This note is based on van Eijl [8].