1.
Adjacency preservers, symmetric matrices, and coresMarko Orel, 2012, original scientific article
Abstract: It 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.
Found in: ključnih besedah
Summary of found: ...It is shown that the graph ▫$\Gamma_n$▫ that has the set of all... ...matrix, finite field, eigenvalue of a graph, coloring, quadratic form...
Keywords: adjacency preserver, symmetric matrix, finite field, eigenvalue of a graph, coloring, quadratic form
Published: 15.10.2013; Views: 1483; Downloads: 78
Full text (0,00 KB)