On the trace graph of matrices (Q2317449)

From MaRDI portal





scientific article; zbMATH DE number 7091819
Language Label Description Also known as
English
On the trace graph of matrices
scientific article; zbMATH DE number 7091819

    Statements

    On the trace graph of matrices (English)
    0 references
    0 references
    0 references
    9 August 2019
    0 references
    Let $n\geq 2$ be an integer, and let $M_n(R)$ be the ring of $n\times n$ matrices over a commutative ring $R$. The associated trace graph $\Gamma_t(M_n(R))$, introduced in \textit{F. A. A. Almahdi} et al. [Acta Math. Hung. 156, No. 1, 132--144 (2018; Zbl 1413.16043)] is the undirected graph whose vertices are all non-zero matrices $A\in M_n(R)$ with the property that there exists a non-zero $B\in M_n(R)$ such that $Tr(AB)=0$, where $Tr$ denotes the usual trace of a matrix; two vertices $A$ and $B$ of this graph are connected by an edge if and only if $Tr(AB)=0$. In the paper under review the authors give several properties of $\Gamma_t(M_n(R))$. For example, they show that $\Gamma_t(M_n(R))$ is 2-connected and sub-Eulerian; also it contains at least one vertex of odd degree, every edge lies on a triangle, and any vertex lies on a cycle of length 4. An upper bound for the domination number of $\Gamma_t(M_n(R))$ is obtained, and this domination number is showed to be 3 in the case where $R=\mathbb{Z}_2$. It is proved that $\Gamma_t(M_n(R))$ is non-planar. Some results on the genus of this graph are obtained, and the rings $R$ for which this graph has thickness 2 are determined.
    0 references
    trace graph
    0 references
    matrix ring
    0 references
    sub Eulerian
    0 references
    super Eulerian
    0 references
    domination number
    0 references
    semisimple ring
    0 references

    Identifiers

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