Adjacency preservers, symmetric matrices, and cores
Adjacency preservers, symmetric matrices, and cores
复制标题
DOI：
10.1007/s10801-011-0318-0
复制
发表时间：
2012-06
影响因子：
0.8
通讯作者：
M. Orel
中科院分区：
文献类型：
--
作者：
M. Orel
证明了以有限域上所有n × n对称矩阵的集合为顶点集，且两个矩阵相邻的充要条件是它们的差的秩等于1的图Γ n是一个核，如果n ≥3.并计算了图Γ n的特征值。
It is shown that the graphΓnthat has the set of alln×nsymmetric matrices over a finite field as the vertex set, with two matrices being adjacent if and only if the rank of their difference equals one, is a core ifn≥3. Eigenvalues of the graphΓnare calculated as well.