20.500.12556/RUP-3395
Adjacency preservers, symmetric matrices, and cores
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.
adjacency preserver
symmetric matrix
finite field
eigenvalue of a graph
coloring
quadratic form
ohranjevalec sosednosti
simetrična matrika
končni obseg
lastna vrednost grafa
barvanje
kvadratna forma
true
true
false
Angleški jezik
Angleški jezik
Delo ni kategorizirano
2013-10-15 12:08:34
2013-10-15 12:08:34
2024-03-01 12:10:45
0000-00-00 00:00:00
2012
0
0
str. 633-647
no. 4
Vol. 35
2012
0000-00-00
NiDoloceno
NiDoloceno
NiDoloceno
0000-00-00
0000-00-00
0000-00-00
0925-9899
512.643
1024376404
http://dx.doi.org/10.1007/s10801-011-0318-0
1
https://repozitorij.upr.si/Dokument.php?lang=slv&id=3395
Inštitut Andrej Marušič
0
0
0