On maximal distances in a commuting graph

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	On maximal distances in a commuting graph
Authors:	ID Dolinar, Gregor (Author) ID Kuzma, Bojan (Author) ID Oblak, Polona (Author)
Files:	http://www.math.technion.ac.il/iic/ela/ela-articles/articles/vol23_pp243-256.pdf
Language:	English
Work type:	Not categorized
Typology:	1.01 - Original Scientific Article
Organization:	IAM - Andrej Marušič Institute
Abstract:	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.
Keywords:	matematika, linearna algebra, teorija grafov, komutirajoči grafi, matrična algebra, algebraično zaprt obseg, centralizator, razdalja v grafih, mathematics, linear algebra, graph theory, commuting graph, matrix algebra, algebraically closed field, centralizer, distance in graphs
Year of publishing:	2012
Number of pages:	str. 243-256
Numbering:	Vol. 23
PID:	20.500.12556/RUP-7736
ISSN:	1081-3810
UDC:	512.64
COBISS.SI-ID:	16313689
Publication date in RUP:	03.04.2017
Views:	2964
Downloads:	264
Metadata:
:	DOLINAR, Gregor, KUZMA, Bojan and OBLAK, Polona, 2012, On maximal distances in a commuting graph. [online]. 2012. Vol. 23, p. 243–256. [Accessed 5 April 2025]. Retrieved from: http://www.math.technion.ac.il/iic/ela/ela-articles/articles/vol23_pp243-256.pdf Copy citation