On the diameters of commuting graphs (Q852638): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.laa.2006.01.029 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Juan Ramón Torregrosa Sánchez / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2006.01.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2108587835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commuting Graphs of Matrix Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On commuting graphs of semisimple rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commuting graphs of some subsets in simple rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4848757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebras generated by two idempotents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous triangularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems On Matrices With Real Quaternion Elements / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.LAA.2006.01.029 / rank
 
Normal rank

Latest revision as of 05:23, 10 December 2024

scientific article
Language Label Description Also known as
English
On the diameters of commuting graphs
scientific article

    Statements

    On the diameters of commuting graphs (English)
    0 references
    0 references
    15 November 2006
    0 references
    For two vertices \(u\) and \(v\) in a graph \(G\), the distance between \(u\) and \(v\), denoted by \(d(u,v)\), is the length of the shortest path between \(u\) and \(v\), if such a path exists; otherwise \(d(u,v)=\infty\). The diameter of a graph \(G\) is defined by \(\text{diam}(G)=\sup \{d(u,v) : u, v\) distinct vertices of \(G\}\). The commuting graph of a ring \({\mathcal R}\), denoted by \(\Gamma({\mathcal R})\), is a graph whose vertices are all non-central elements of \({\mathcal R}\) and two distinct vertices \(x\) and \(y\) are adjacent if and only if \(xy=yx\). Let \(D\) be a division ring and \(M_n(D)\) the set of all \(n \times n\) matrices over \(D\), \(n \geq 3\). The authors analyze the diameters of \(\Gamma(M_n(D))\) and investigate the diameters of some induced subgraphs of \(\Gamma(M_n(D))\). Specifically, they determine the diameter of the induced subgraphs on the set of non-invertible, nilpotent, idempotent and involution matrices in \(M_n(D)\). For every field \(F\), the authors show that if \(\Gamma(M_n(F))\) is a connected graph, then \(\text{diam}( \Gamma(M_n(F)))\) is at most 6 and if \(F\) is an algebraically closed field or \(n\) is a prime number and \(\Gamma(M_n(F))\) is a connected graph, then \(\text{diam}( \Gamma(M_n(F)))=4\). Finally, the authors present some applications to the structure of pairs of idempotents in \(M_n(F)\), for any field \(F\) and \(n \geq 2\).
    0 references
    division ring
    0 references
    nilpotent
    0 references
    idempotent
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references