Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Vertex and region colorings of planar idempotent divisor graphs of commutative rings.

View through CrossRef
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.
Title: Vertex and region colorings of planar idempotent divisor graphs of commutative rings.
Description:
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.

Related Results

Monodromías geométricas en familias de curvas de género 4
Monodromías geométricas en familias de curvas de género 4
The goal of the thesis is the effective computation of the geometric monodromy, equivalently the monodromy in the fundamental group, for families of compact connected Riemann surfa...
Bipartite through Prescribed Median and Antimedian of a Commutative Ring with Respect to an Ideal
Bipartite through Prescribed Median and Antimedian of a Commutative Ring with Respect to an Ideal
Introduction: There are plenty of ways of partners with arithmetical constructions. Some of them to make reference to are bipartite from gatherings, median and anti – median from c...
Engineering Design Methodology for Robot-Based Non-Planar Additive Manufacturing (RbNPAM)
Engineering Design Methodology for Robot-Based Non-Planar Additive Manufacturing (RbNPAM)
Robot-Based Non-Planar Additive Manufacturing (RbNPAM) explores advancements in integrating robotics with additive manufacturing, focusing on the development and application of non...
Effects of cleaning in Saturn's rings
Effects of cleaning in Saturn's rings
Saturn's rings are well known for many good reasons, one of them being their brightness. Made of almost 99% water ice, they are by far the most ice-rich object of the solar system,...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Energy of zero-divisor graphs via distance-based fuzzy adjacency matrices
Energy of zero-divisor graphs via distance-based fuzzy adjacency matrices
In this paper, we investigate the energy of zero-divisor graphs of finite commutative rings with unity using the distance-based fuzzy adjacency matrix. In view of this, first we ch...

Back to Top