Marko Orel (Author)

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.

Keywords

ohranjevalec sosednosti;simetrična matrika;končni obseg;lastna vrednost grafa;barvanje;kvadratna forma;adjacency preserver;symmetric matrix;finite field;eigenvalue of a graph;coloring;quadratic form;

Data

Language: English
Year of publishing:
Typology: 1.01 - Original Scientific Article
Organization: UP - University of Primorska
UDC: 512.643
COBISS: 1024376404 Link will open in a new window
ISSN: 0925-9899
Views: 2970
Downloads: 140
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Secondary keywords: ohranjevalec sosednosti;simetrična matrika;končni obseg;lastna vrednost grafa;barvanje;kvadratna forma;
Type (COBISS): Not categorized
Pages: str. 633-647
Volume: ǂVol. ǂ35
Issue: ǂno. ǂ4
Chronology: 2012
DOI: 10.1007/s10801-011-0318-0
ID: 1477172