<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.upr.si/IzpisGradiva.php?id=3395"><dc:title>Adjacency preservers, symmetric matrices, and cores</dc:title><dc:creator>Orel,	Marko	(Avtor)
	</dc:creator><dc:subject>adjacency preserver</dc:subject><dc:subject>symmetric matrix</dc:subject><dc:subject>finite field</dc:subject><dc:subject>eigenvalue of a graph</dc:subject><dc:subject>coloring</dc:subject><dc:subject>quadratic form</dc:subject><dc:description>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.</dc:description><dc:date>2012</dc:date><dc:date>2013-10-15 12:08:34</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>3395</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
