<?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=7736"><dc:title>On maximal distances in a commuting graph</dc:title><dc:creator>Dolinar,	Gregor	(Avtor)
	</dc:creator><dc:creator>Kuzma,	Bojan	(Avtor)
	</dc:creator><dc:creator>Oblak,	Polona	(Avtor)
	</dc:creator><dc:subject>matematika</dc:subject><dc:subject>linearna algebra</dc:subject><dc:subject>teorija grafov</dc:subject><dc:subject>komutirajoči grafi</dc:subject><dc:subject>matrična algebra</dc:subject><dc:subject>algebraično zaprt obseg</dc:subject><dc:subject>centralizator</dc:subject><dc:subject>razdalja v grafih</dc:subject><dc:subject>mathematics</dc:subject><dc:subject>linear algebra</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>commuting graph</dc:subject><dc:subject>matrix algebra</dc:subject><dc:subject>algebraically closed field</dc:subject><dc:subject>centralizer</dc:subject><dc:subject>distance in graphs</dc:subject><dc:subject/><dc:description>It is shown that matrices over algebraically closed fields that are farthest apart in the commuting graph must be non-derogatory. Rank-one matrices and diagonalizable matrices are also characterized in terms of the commuting graph.</dc:description><dc:date>2012</dc:date><dc:date>2016-04-08 16:47:12</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>7736</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>