DOMINATION IN THE TOTAL GRAPH ON ℤn

2011 ◽  
Vol 03 (04) ◽  
pp. 413-421 ◽  
Author(s):  
T. TAMIZH CHELVAM ◽  
T. ASIR
Keyword(s):  
Commutative Ring ◽  
Prime Divisor ◽  
Undirected Graph ◽  
Domination Number ◽  
Total Graph ◽  
Zero Divisors ◽  
Vertex Set ◽  
Domination Numbers

For a commutative ring R, let Z(R) be its set of zero-divisors. The total graph of R, denoted by TΓ(R), is the undirected graph with vertex set R, and for distinct x, y ∈ R, the vertices x and y are adjacent if and only if x + y ∈ Z(R). Tamizh Chelvam and Asir studied about the domination in the total graph of a commutative ring R. In particular, it was proved that the domination number γ(TΓ(ℤn)) = p1 where p1 is the smallest prime divisor of n. In this paper, we characterize all the γ-sets in TΓ(ℤn). Also, we obtain the values of other domination parameters like independent, total and perfect domination numbers of the total graph on ℤn.

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

2013 ◽  
Vol 12 (04) ◽  
pp. 1250198 ◽  
Author(s):  
T. TAMIZH CHELVAM ◽  
T. ASIR
Keyword(s):  
Commutative Ring ◽  
Domination Number ◽  
Intersection Graph ◽  
Total Graph ◽  
Graph Theoretic ◽  
Zero Divisors ◽  
Artin Ring ◽  
Transitive Property ◽  
Vertex Set ◽  
Vertex Transitive

Let R be a commutative ring and Z(R) be its set of all zero-divisors. Anderson and Badawi [The total graph of a commutative ring, J. Algebra320 (2008) 2706–2719] introduced the total graph of R, denoted by TΓ(R), as the undirected graph with vertex set R, and two distinct vertices x and y are adjacent if and only if x + y ∈ Z(R). Tamizh Chelvam and Asir [Domination in the total graph of a commutative ring, to appear in J. Combin. Math. Combin. Comput.] obtained the domination number of the total graph and studied certain other domination parameters of TΓ(R) where R is a commutative Artin ring. The intersection graph of gamma sets in TΓ(R) is denoted by ITΓ(R). Tamizh Chelvam and Asir [Intersection graph of gamma sets in the total graph, Discuss. Math. Graph Theory32 (2012) 339–354, doi:10.7151/dmgt.1611] initiated a study about the intersection graph ITΓ (ℤn) of gamma sets in TΓ(ℤn). In this paper, we study about ITΓ(R), where R is a commutative Artin ring. Actually we investigate the interplay between graph-theoretic properties of ITΓ(R) and ring-theoretic properties of R. At the first instance, we prove that diam (ITΓ(R)) ≤ 2 and gr (ITΓ(R)) ≤ 4. Also some characterization results regarding completeness, bipartite, cycle and chordal nature of ITΓ(R) are given. Further, we discuss about the vertex-transitive property of ITΓ(R). At last, we obtain all commutative Artin rings R for which ITΓ(R) is either planar or toroidal or genus two.

ON THE TOTAL GRAPH OF A COMMUTATIVE RING WITHOUT THE ZERO ELEMENT

2012 ◽  
Vol 11 (04) ◽  
pp. 1250074 ◽  
Author(s):  
DAVID F. ANDERSON ◽  
AYMAN BADAWI
Keyword(s):  
Commutative Ring ◽  
Zero Divisor ◽  
Undirected Graph ◽  
Zero Element ◽  
Induced Subgraphs ◽  
Total Graph ◽  
Zero Divisors ◽  
Nonzero Identity

Let R be a commutative ring with nonzero identity, and let Z(R) be its set of zero-divisors. The total graph of R is the (undirected) graph T(Γ(R)) with vertices all elements of R, and two distinct vertices x and y are adjacent if and only if x + y ∈ Z(R). In this paper, we study the two (induced) subgraphs Z0(Γ(R)) and T0(Γ(R)) of T(Γ(R)), with vertices Z(R)\{0} and R\{0}, respectively. We determine when Z0(Γ(R)) and T0(Γ(R)) are connected and compute their diameter and girth. We also investigate zero-divisor paths and regular paths in T0(Γ(R)).

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.

The metric dimension of annihilator graphs of commutative rings

2019 ◽  
Vol 19 (05) ◽  
pp. 2050089
Author(s):  
V. Soleymanivarniab ◽  
A. Tehranian ◽  
R. Nikandish
Keyword(s):  
Commutative Ring ◽  
Undirected Graph ◽  
Commutative Rings ◽  
Metric Dimension ◽  
Zero Divisors ◽  
Vertex Set ◽  
Annihilator Graph ◽  
Nonzero Identity

Let [Formula: see text] be a commutative ring with nonzero identity. The annihilator graph of [Formula: see text], denoted by [Formula: see text], is the (undirected) graph whose vertex set is the set of all nonzero zero-divisors of [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text]. In this paper, we study the metric dimension of annihilator graphs associated with commutative rings and some metric dimension formulae for annihilator graphs are given.

scholarly journals INTERSECTION GRAPH OF A MODULE

2013 ◽  
Vol 12 (05) ◽  
pp. 1250218 ◽  
Author(s):  
ERGÜN YARANERI
Keyword(s):  
Commutative Ring ◽  
Chromatic Number ◽  
Undirected Graph ◽  
Domination Number ◽  
Intersection Graph ◽  
Combinatorial Properties ◽  
Algebraic Properties ◽  
Vertex Set ◽  
Multiple Edges

Let V be a left R-module where R is a (not necessarily commutative) ring with unit. The intersection graph [Formula: see text] of proper R-submodules of V is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper R-submodules of V, and there is an edge between two distinct vertices U and W if and only if U ∩ W ≠ 0. We study these graphs to relate the combinatorial properties of [Formula: see text] to the algebraic properties of the R-module V. We study connectedness, domination, finiteness, coloring, and planarity for [Formula: see text]. For instance, we find the domination number of [Formula: see text]. We also find the chromatic number of [Formula: see text] in some cases. Furthermore, we study cycles in [Formula: see text], and complete subgraphs in [Formula: see text] determining the structure of V for which [Formula: see text] is planar.

Total graph of the ring ℤn × ℤm

2015 ◽  
Vol 07 (01) ◽  
pp. 1550004 ◽  
Author(s):  
Alpesh M. Dhorajia
Keyword(s):  
Commutative Ring ◽  
Undirected Graph ◽  
Clique Number ◽  
Total Graph ◽  
Fundamental Properties ◽  
Zero Divisors ◽  
Independent Number ◽  
Positive Integers

Let R be a commutative ring and Z(R) be the set of all zero-divisors of R. The total graph of R, denoted by T Γ(R), is the (undirected) graph with vertices set R. For any two distinct elements x, y ∈ R, the vertices x and y are adjacent if and only if x + y ∈ Z(R). In this paper, we obtain certain fundamental properties of the total graph of ℤn × ℤm, where n and m are positive integers. We determine the clique number and independent number of the total graph T Γ(ℤn × ℤm).

scholarly journals When the annihilator graph of a commutative ring is planar or toroidal?

2020 ◽  
Vol 24 (2) ◽  
pp. 281-290
Author(s):  
Moharram Bakhtyiari ◽  
Reza Nikandish ◽  
Mohammad Javad Nikmehr
Keyword(s):  
Commutative Ring ◽  
Undirected Graph ◽  
Zero Divisors ◽  
Vertex Set ◽  
Annihilator Graph

Let R be a commutative ring with identity, and let Z(R) be the set of zero-divisors of R. The annihilator graph of R is defined as the undirected graph AG(R) with the vertex set Z(R)* = Z(R) \ {0}, and two distinct vertices x and y are adjacent if and only if  ann_R(xy) \neq ann_R(x) \cup ann_R(y). In this paper, all rings whose annihilator graphs can be embedded on the plane or torus are classified.

scholarly journals Domination in the entire nilpotent element graph of a module over a commutative ring

2021 ◽  
Vol 40 (6) ◽  
pp. 1411-1430
Author(s):  
Jituparna Goswami ◽  
Masoumeh Shabani
Keyword(s):  
Commutative Ring ◽  
Nilpotent Element ◽  
Undirected Graph ◽  
Domination Number ◽  
Induced Subgraphs ◽  
Nilpotent Elements ◽  
Bondage Number ◽  
Vertex Set

Let R be a commutative ring with unity and M be a unitary R module. Let Nil(M) be the set of all nilpotent elements of M. The entire nilpotent element graph of M over R is an undirected graph E(G(M)) with vertex set as M and any two distinct vertices x and y are adjacent if and only if x + y ∈ Nil(M). In this paper we attempt to study the domination in the graph E(G(M)) and investigate the domination number as well as bondage number of E(G(M)) and its induced subgraphs N(G(M)) and Non(G(M)). Some domination parameters of E(G(M)) are also studied. It has been showed that E(G(M)) is excellent, domatically full and well covered under certain conditions.

scholarly journals Dot product graphs and domination number

2020 ◽  
Vol 28 (1) ◽  
Author(s):  
Dina Saleh ◽  
Nefertiti Megahed
Keyword(s):  
Commutative Ring ◽  
Upper Bound ◽  
Undirected Graph ◽  
Multiplicative Group ◽  
Domination Number ◽  
Product Graph ◽  
Group Of Units ◽  
Product Graphs ◽  
Vertex Set ◽  
Dot Product

Abstract Let A be a commutative ring with 1≠0 and R=A×A. The unit dot product graph of R is defined to be the undirected graph UD(R) with the multiplicative group of units in R, denoted by U(R), as its vertex set. Two distinct vertices x and y are adjacent if and only if x·y=0∈A, where x·y denotes the normal dot product of x and y. In 2016, Abdulla studied this graph when $A=\mathbb {Z}_{n}$ A = ℤ n , $n \in \mathbb {N}$ n ∈ ℕ , n≥2. Inspired by this idea, we study this graph when A has a finite multiplicative group of units. We define the congruence unit dot product graph of R to be the undirected graph CUD(R) with the congruent classes of the relation $\thicksim $ ∽ defined on R as its vertices. Also, we study the domination number of the total dot product graph of the ring $R=\mathbb {Z}_{n}\times... \times \mathbb {Z}_{n}$ R = ℤ n × ... × ℤ n , k times and k<∞, where all elements of the ring are vertices and adjacency of two distinct vertices is the same as in UD(R). We find an upper bound of the domination number of this graph improving that found by Abdulla.

scholarly journals Complement of the generalized total graph of Zn

Filomat ◽  
2019 ◽  
Vol 33 (18) ◽  
pp. 6103-6113 ◽  
Author(s):  
Chelvam Tamizh ◽  
M. Balamurugan
Keyword(s):  
Prime Ideal ◽  
Commutative Ring ◽  
Independence Number ◽  
Domination Number ◽  
Simple Graph ◽  
Total Graph ◽  
Vertex Set

Let R be a commutative ring with identity and H be a nonempty proper multiplicative prime subset of R. The generalized total graph of R is the (undirected) simple graph ?GTH(R) with all elements of R as the vertex set and two distinct vertices x and y are adjacent if and only if x + y ? H. The complement of the generalized total graph ?GTH(R) of R is the (undirected) simple graphwith vertex set R and two distinct vertices x and y are adjacent if and only if x + y < H. In this paper, we investigate certain domination properties of ?GTH(R). In particular, we obtain the domination number, independence number and a characterization for -sets in ?GTP(Zn) where P is a prime ideal of Zn. Further, we discuss properties like Eulerian, Hamiltonian, planarity, and toroidality of GTP(Zn).

Sign in / Sign up

Export Citation Format

Share Document