Open AccessVertex and region colorings of planar idempotent divisor graphs of commutative rings.
Author(s) -
Mohammed Authman
Publication year - 2022
Publication title -
iraqi journal for computer science and mathematics
Language(s) - English
Resource type - Journals
eISSN - 2958-0544
pISSN - 2788-7421
DOI - 10.52866/ijcsm.2022.01.01.008
Subject(s) - mathematics , combinatorics , idempotence , clique number , commutative ring , vertex (graph theory) , discrete mathematics , graph , commutative property
The idempotent divisor graph of a commutative ring R is a graph with vertices set in R* = R-{0}, and any distinct vertices x and y are adjacent if and only if x.y = e, for some non-unit idempotent element e2 = e ϵ R, and is denoted by Л(R). The purpose of this work is using some properties of ring theory and graph theory to find the clique number, the chromatic number and the region chromatic number for every planar idempotent divisor graphs of commutative rings. Also we show the clique number is equal to the chromatic number for any planar idempotent divisor graph. Among other results we prove that: Let Fq, Fpa are fieldes of orders q and pa respectively, where q=2 or 3, p is a prime number and a Is a positive integer. If a ring R @ Fq x Fpa . Then (Л(R))= (Л(R)) = *( Л(R)) = 3.