Finite commutative ring with genus two essential graph

2018 ◽  
Vol 17 (07) ◽  
pp. 1850121
Author(s):  
K. Selvakumar ◽  
M. Subajini ◽  
M. J. Nikmehr
Keyword(s):  
Commutative Ring ◽  
Commutative Rings ◽  
Zero Divisors ◽  
Essential Ideal ◽  
Vertex Set ◽  
Finite Commutative Ring ◽  
Genus Two ◽  
Finite Commutative Rings

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.

Crosscap two of class of graphs from commutative rings

2021 ◽  
Author(s):  
S. Karthik ◽  
S. N. Meera ◽  
K. Selvakumar
Keyword(s):  
Commutative Ring ◽  
Undirected Graph ◽  
Commutative Rings ◽  
Zero Divisors ◽  
Essential Ideal ◽  
Vertex Set ◽  
Annihilator Graph ◽  
Finite Commutative Rings

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.

PLANAR, OUTERPLANAR, AND RING GRAPH OF THE COZERO-DIVISOR GRAPH OF A FINITE COMMUTATIVE RING

2012 ◽  
Vol 11 (06) ◽  
pp. 1250103 ◽  
Author(s):  
MOJGAN AFKHAMI ◽  
KAZEM KHASHYARMANESH
Keyword(s):  
Commutative Ring ◽  
Commutative Rings ◽  
Vertex Set ◽  
Finite Commutative Ring ◽  
Ring Graph ◽  
Nonzero Identity ◽  
Finite Commutative Rings

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.

scholarly journals Metric and upper dimension of zero divisor graphs associated to commutative rings

2020 ◽  
Vol 12 (1) ◽  
pp. 84-101 ◽  
Author(s):  
S. Pirzada ◽  
M. Aijaz
Keyword(s):  
Commutative Ring ◽  
Zero Divisor ◽  
Commutative Rings ◽  
Metric Dimension ◽  
Zero Divisor Graph ◽  
Zero Divisors ◽  
Vertex Set ◽  
Finite Commutative Rings

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.

The Square Mapping Graphs of Finite Commutative Rings

2012 ◽  
Vol 19 (03) ◽  
pp. 569-580 ◽  
Author(s):  
Yangjiang Wei ◽  
Gaohua Tang ◽  
Huadong Su
Keyword(s):  
Fixed Points ◽  
Commutative Ring ◽  
Sufficient Conditions ◽  
Commutative Rings ◽  
Directed Edge ◽  
Induced Subgraph ◽  
Zero Divisors ◽  
Finite Commutative Ring ◽  
Necessary And Sufficient ◽  
Finite Commutative Rings

For a finite commutative ring R, the square mapping graph of R is a directed graph Γ(R) whose set of vertices is all the elements of R and for which there is a directed edge from a to b if and only if a2=b. We establish necessary and sufficient conditions for the existence of isolated fixed points, and the cycles with length greater than 1 in Γ(R). We also examine when the induced subgraph on the set of zero-divisors of a local ring with odd characteristic is semiregular. Moreover, we completely determine the finite commutative rings whose square mapping graphs have exactly two, three or four components.

THE INTERSECTION GRAPH OF GAMMA SETS IN THE TOTAL GRAPH OF A COMMUTATIVE RING-II

2013 ◽  
Vol 12 (04) ◽  
pp. 1250199 ◽  
Author(s):  
T. ASIR ◽  
T. TAMIZH CHELVAM
Keyword(s):  
Commutative Ring ◽  
Independence Number ◽  
Clique Number ◽  
Commutative Rings ◽  
Intersection Graph ◽  
Vertex Connectivity ◽  
Total Graph ◽  
Graph Theoretic ◽  
Vertex Set ◽  
Finite Commutative Rings

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).

On zero-divisor graphs of commutative rings without identity

2019 ◽  
Vol 19 (12) ◽  
pp. 2050226 ◽  
Author(s):  
G. Kalaimurugan ◽  
P. Vignesh ◽  
T. Tamizh Chelvam
Keyword(s):  
Commutative Ring ◽  
Zero Divisor ◽  
Commutative Rings ◽  
Zero Divisor Graph ◽  
Finite Commutative Ring ◽  
Free Order ◽  
Finite Commutative Rings

Let [Formula: see text] be a finite commutative ring without identity. In this paper, we characterize all finite commutative rings without identity, whose zero-divisor graphs are unicyclic, claw-free and tree. Also, we obtain all finite commutative rings without identity and of cube-free order for which the corresponding zero-divisor graph is toroidal.

Unitary homogeneous bi-Cayley graphs over finite commutative rings

2019 ◽  
Vol 19 (09) ◽  
pp. 2050173
Author(s):  
Xiaogang Liu ◽  
Chengxin Yan
Keyword(s):  
Commutative Ring ◽  
Cayley Graph ◽  
Line Graph ◽  
Cayley Graphs ◽  
Commutative Rings ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Finite Commutative Ring ◽  
Necessary And Sufficient ◽  
Finite Commutative Rings

Let [Formula: see text] denote the unitary homogeneous bi-Cayley graph over a finite commutative ring [Formula: see text]. In this paper, we determine the energy of [Formula: see text] and that of its complement and line graph, and characterize when such graphs are hyperenergetic. We also give a necessary and sufficient condition for [Formula: see text] (respectively, the complement of [Formula: see text], the line graph of [Formula: see text]) to be Ramanujan.

Nilpotent graphs of genus one

2014 ◽  
Vol 06 (03) ◽  
pp. 1450037
Author(s):  
R. Kala ◽  
S. Kavitha
Keyword(s):  
Commutative Ring ◽  
Commutative Rings ◽  
Isomorphism Classes ◽  
Vertex Set ◽  
Genus One ◽  
Finite Commutative Rings

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.

The genus two class of graphs arising from rings

2018 ◽  
Vol 17 (10) ◽  
pp. 1850193 ◽  
Author(s):  
T. Asir
Keyword(s):  
Commutative Ring ◽  
Jacobson Radical ◽  
Commutative Rings ◽  
Isomorphism Classes ◽  
Jacobson Graph ◽  
Vertex Set ◽  
Genus Two

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.

On the symmetric digraphs from the kth power mapping on finite commutative rings

2015 ◽  
Vol 07 (01) ◽  
pp. 1450064 ◽  
Author(s):  
Guixin Deng ◽  
Lawrence Somer
Keyword(s):  
Positive Integer ◽  
Commutative Ring ◽  
Sufficient Conditions ◽  
Commutative Rings ◽  
Connected Components ◽  
Directed Edge ◽  
Finite Commutative Ring ◽  
Power Mapping ◽  
Factor G ◽  
Finite Commutative Rings

For a finite commutative ring R and a positive integer k, let G(R, k) denote the digraph whose set of vertices is R and for which there is a directed edge from a to ak. The digraph G(R, k) is called symmetric of order M if its set of connected components can be partitioned into subsets of size M with each subset containing M isomorphic components. We primarily aim to factor G(R, k) into the product of its subdigraphs. If the characteristic of R is a prime p, we obtain several sufficient conditions for G(R, k) to be symmetric of order M.

Sign in / Sign up

Export Citation Format

Share Document