Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bolonia study programme

Options:
  Reset


1 - 1 / 1
First pagePrevious page1Next pageLast page
1.
Adjacency preservers, symmetric matrices, and cores
Marko 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: ...adjacency preserver, symmetric matrix, finite field, eigenvalue of a...
Keywords: adjacency preserver, symmetric matrix, finite field, eigenvalue of a graph, coloring, quadratic form
Published: 15.10.2013; Views: 1616; Downloads: 85
URL Full text (0,00 KB)

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica