Adjacency preservers, symmetric matrices, and cores

作者：Orel Marko^*

来源：Journal of Algebraic Combinatorics, 2012, 35(4): 633-647.

DOI：10.1007/s10801-011-0318-0

• Core
• Adjacency preserver
• Symmetric matrix
• Finite field
• Eigenvalue of a graph
• Coloring
• Quadratic form

It is shown that the graph I%26quot; (n) that has the set of all nxn symmetric 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 if na parts per thousand yen3. Eigenvalues of the graph I%26quot; (n) are calculated as well.

• 出版日期2012-6