Finite commutative rings with higher genus unit graphs

2014 ◽  
Vol 14 (01) ◽  
pp. 1550002 ◽  
Author(s):  
Huadong Su ◽  
Kenta Noguchi ◽  
Yiqiang Zhou

Let R be a ring with identity. The unit graph of R, denoted by G(R), is a simple graph with vertex set R, and where two distinct vertices x and y are adjacent if and only if x + y is a unit in R. The genus of a simple graph G is the smallest nonnegative integer g such that G can be embedded into an orientable surface Sg. In this paper, we determine all isomorphism classes of finite commutative rings whose unit graphs have genus at most three.

2014 ◽  
Vol 06 (03) ◽  
pp. 1450037
Author(s):  
R. Kala ◽  
S. Kavitha

Let R be a commutative ring with identity. The nilpotent graph of R, denoted by ΓN(R), is a graph with vertex set [Formula: see text], and two vertices x and y are adjacent if and only if xy is nilpotent, where [Formula: see text] is nilpotent, for some y ∈ R*}. In this paper, we determine all isomorphism classes of finite commutative rings with identity whose ΓN(R) has genus one.


2013 ◽  
Vol 12 (04) ◽  
pp. 1250199 ◽  
Author(s):  
T. ASIR ◽  
T. TAMIZH CHELVAM

The intersection graph ITΓ(R) of gamma sets in the total graph TΓ(R) of a commutative ring R, is the undirected graph with vertex set as the collection of all γ-sets in the total graph of R and two distinct vertices u and v are adjacent if and only if u ∩ v ≠ ∅. Tamizh Chelvam and Asir [The intersection graph of gamma sets in the total graph I, to appear in J. Algebra Appl.] studied about ITΓ(R) where R is a commutative Artin ring. In this paper, we continue our interest on ITΓ(R) and actually we study about Eulerian, Hamiltonian and pancyclic nature of ITΓ(R). Further, we focus on certain graph theoretic parameters of ITΓ(R) like the independence number, the clique number and the connectivity of ITΓ(R). Also, we obtain both vertex and edge chromatic numbers of ITΓ(R). In fact, it is proved that if R is a finite commutative ring, then χ(ITΓ(R)) = ω(ITΓ(R)). Having proved that ITΓ(R) is weakly perfect for all finite commutative rings, we further characterize all finite commutative rings for which ITΓ(R) is perfect. In this sequel, we characterize all commutative Artin rings for which ITΓ(R) is of class one (i.e. χ′(ITΓ(R)) = Δ(ITΓ(R))). Finally, it is proved that the vertex connectivity and edge connectivity of ITΓ(R) are equal to the degree of any vertex in ITΓ(R).


2018 ◽  
Vol 17 (07) ◽  
pp. 1850121
Author(s):  
K. Selvakumar ◽  
M. Subajini ◽  
M. J. Nikmehr

Let [Formula: see text] be a commutative ring with identity and let [Formula: see text] be the set of zero-divisors of [Formula: see text]. The essential graph of [Formula: see text] is defined as the graph [Formula: see text] with the vertex set [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text] is an essential ideal. In this paper, we classify all finite commutative rings with identity for which the genus of [Formula: see text] is two.


2012 ◽  
Vol 11 (06) ◽  
pp. 1250103 ◽  
Author(s):  
MOJGAN AFKHAMI ◽  
KAZEM KHASHYARMANESH

Let R be a commutative ring with nonzero identity. The cozero-divisor graph of R, denoted by Γ′(R), is a graph with vertex-set W*(R), which is the set of all nonzero and non-unit elements of R, and two distinct vertices a and b in W*(R) are adjacent if and only if a ∉ Rb and b ∉ Ra. In this paper, we characterize all finite commutative rings R such that Γ′(R) is planar, outerplanar or ring graph.


2020 ◽  
Vol 12 (1) ◽  
pp. 84-101 ◽  
Author(s):  
S. Pirzada ◽  
M. Aijaz

AbstractLet R be a commutative ring with Z*(R) as the set of non-zero zero divisors. The zero divisor graph of R, denoted by Γ(R), is the graph whose vertex set is Z*(R), where two distinct vertices x and y are adjacent if and only if xy = 0. In this paper, we investigate the metric dimension dim(Γ(R)) and upper dimension dim+(Γ(R)) of zero divisor graphs of commutative rings. For zero divisor graphs Γ(R) associated to finite commutative rings R with unity 1 ≠ 0, we conjecture that dim+(Γ(R)) = dim(Γ(R)), with one exception that {\rm{R}} \cong \Pi {\rm\mathbb{Z}}_2^{\rm{n}}, n ≥ 4. We prove that this conjecture is true for several classes of rings. We also provide combinatorial formulae for computing the metric and upper dimension of zero divisor graphs of certain classes of commutative rings besides giving bounds for the upper dimension of zero divisor graphs of rings.


2021 ◽  
Vol 6 (10) ◽  
pp. 11508-11515
Author(s):  
Zhiqun Li ◽  
◽  
Huadong Su

<abstract><p>Let $ R $ be a ring with nonzero identity. The unit graph of $ R $ is a simple graph whose vertex set is $ R $ itself and two distinct vertices are adjacent if and only if their sum is a unit of $ R $. In this paper, we study the radius of unit graphs of rings. We prove that there exists a ring $ R $ such that the radius of unit graph can be any given positive integer. We also prove that the radius of unit graphs of self-injective rings are 1, 2, 3, $ \infty $. We classify all self-injective rings via the radius of its unit graph. The radius of unit graphs of some ring extensions are also considered.</p></abstract>


Author(s):  
S. Karthik ◽  
S. N. Meera ◽  
K. Selvakumar

Let [Formula: see text] be a commutative ring with identity and [Formula: see text] be the set of all nonzero zero-divisors of [Formula: see text]. The annihilator graph of commutative ring [Formula: see text] is the simple undirected graph [Formula: see text] with vertices [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text]. The essential graph of [Formula: see text] is defined as the graph [Formula: see text] with the vertex set [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text] is an essential ideal. In this paper, we classify all finite commutative rings with identity whose annihilator graph and essential graph have crosscap two.


2016 ◽  
Vol 08 (02) ◽  
pp. 1650029 ◽  
Author(s):  
A. Alilou ◽  
J. Amjadi ◽  
S. M. Sheikholeslami

Let [Formula: see text] be a commutative ring with identity. In this paper, we consider a simple graph associated with [Formula: see text] denoted by [Formula: see text], whose vertex set is the set of all nonzero proper ideals of [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent whenever [Formula: see text] or [Formula: see text]. In this paper, we initiate the study of the graph [Formula: see text] and we investigate its properties. In particular, we show that [Formula: see text] is a connected graph with [Formula: see text] unless [Formula: see text] is isomorphic to a direct product of two fields. Moreover, we characterize all commutative rings [Formula: see text] with at least two maximal ideals for which [Formula: see text] are planar.


2018 ◽  
Vol 17 (10) ◽  
pp. 1850193 ◽  
Author(s):  
T. Asir

Given a commutative ring [Formula: see text] with identity [Formula: see text], its Jacobson graph [Formula: see text] is defined to be the graph in which the vertex set is [Formula: see text], and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text]. Here [Formula: see text] denotes the Jacobson radical of [Formula: see text] and [Formula: see text] is the set of unit elements in [Formula: see text]. This paper investigates the genus properties of Jacobson graph. In particular, we determine all isomorphism classes of commutative rings whose Jacobson graph has genus two.


2017 ◽  
Vol 24 (03) ◽  
pp. 481-492 ◽  
Author(s):  
Dhiren Kumar Basnet ◽  
Jayanta Bhattacharyya

In this article, we define the nil clean graph of a ring R. The vertex set is the ring R, and two ring elements a and b are adjacent if and only if a + b is nil clean in R. Graph theoretic properties like the girth, dominating sets, diameter, etc., of the nil clean graph are studied for finite commutative rings.


Sign in / Sign up

Export Citation Format

Share Document