Adjacency preservers, symmetric matrices, and coresOrel, Marko (Avtor) adjacency preserversymmetric matrixfinite fieldeigenvalue of a graphcoloringquadratic formIt is shown that the graph ▫$\Gamma_n$▫ that has the set of all ▫$n \times n$▫ 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 ▫$n \ge 3$▫. Eigenvalues of the graph ▫$\Gamma_n$▫ are calculated as well.20122013-10-15 12:08:34Delo ni kategorizirano3395ISSN: 0925-9899UDK: 512.643COBISS.SI-ID: 1024376404sl