Coloring of cozero-divisor graphs of commutative von Neumann regular rings (Q2197115)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Coloring of cozero-divisor graphs of commutative von Neumann regular rings
scientific article

    Statements

    Coloring of cozero-divisor graphs of commutative von Neumann regular rings (English)
    0 references
    0 references
    0 references
    0 references
    4 September 2020
    0 references
    Let \(R\) be a commutative ring with non-zero identity and \(Z(R)^*\) be the set of all nonzero zero-divisors of \(R\).The study of linking commutative ring theory with graph theory has been started with the concept of the zero-divisor graph of a commutative ring. The zero-divisor graph of \(R\), denoted \(\Gamma(R)\), is the simple graph with \(Z(R)^*\) as the vertex set and two distinct vertices \(x\) and \(y\) are adjacent by an edge if and only if \(xy = 0\). Note that the adjacency in the zero divisor graph makes use the multiplication in \(R\). In connection with zero-divisor graph of \(R\), the notion of the cozero-divisor graph of \(R\), denoted by \(\Gamma^\prime(R)\) is a graph with vertices in \(W^*(R)\), which is the set of all non-zero and non-unit elements of \(R\), and two distinct vertices \(a\) and \(b\) in \(W^*(R)\), are adjacent if and only if \(a\notin Rb\) and \(b\notin Ra\). In this paper, the authors prove that the cozero-divisor graph of a von Neumann regular ring with finite clique number is not only weakly perfect but also perfect. Further, an explicit formula for the clique number is also proved.
    0 references
    cozero-divisor graph
    0 references
    von Neumann regular ring
    0 references
    clique number
    0 references
    chromatic number
    0 references
    perfect graph
    0 references

    Identifiers

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