Several result on SD-prime cordial graphs

Let 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 R ≅ Π 𝕑 2 n {\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.

Let R R be a commutative ring with 1 ≠ 0 1\ne 0 , Z ( R ) Z(R) be the set of all zero-divisors of R R , and n ≥ 1 n \geq 1 . This paper introduces the n n -total graph of a commutative ring R R . The n n -total graph of a commutative ring R R , denoted by n − T ( R ) n-T(R) , is an undirected simple graph with vertex set R R , such that two vertices x , y x, y in R R are connected by an edge if x n + y n x^{n} + y^{n} in Z ( R ) Z(R) . Note that if n = 1 n =1 , then the 1 1 -total graph of R R is the total graph of R R in the sense of Anderson-Badawi’s paper on the total graph of a commutative ring. In this paper, we study some graph properties and theoretical ring structure.

On zero-divisor graphs of small finite commutative rings

ABSTRACTA graph Γ is said to be End-regular if its endomorphism monoid End(Γ) is regular. D. Lu and T. Wu [25] posed an open problem: Given a ring R, when does the zero-divisor graph Γ(R) have a regular endomorphism monoid? and they solved the problem for R a commutative ring with at least one nontrivial idempotent. In this paper, we solve this problem for zero-divisor graphs of group rings.

The zero-divisor graph of a commutative ring R, denoted by Γ(R), is a graph whose two distinct vertices x and y are joined by an edge if and only if xy = 0 or yx = 0. The main problem of the study of graphs defined on algebraic structure is to recognize finite rings through the properties of various graphs defined on it. The main objective of this article is to study the Wiener index of zero-divisor graph and compressed zero-divisor graph of the ring of integer modulo psqt for all distinct primes p, q and . We study the structure of these graphs by dividing the vertex set. Furthermore, a formula for the Wiener index of zero-divisor graph of Γ(R), and a formula for the Wiener index of associated compressed zero-divisor graph ΓE(R) are derived for .

Let R be a commutative ring with non-zero identity. In this paper, we introduce theweakly nilpotent graph of a commutative ring. The weakly nilpotent graph of R denoted by Γw(R) is a graph with the vertex set R* and two vertices x and y are adjacent if and only if x y ∊ N(R)*, where R* = R \ {0} and N(R)* is the set of all non-zero nilpotent elements of R. In this article, we determine the diameter of weakly nilpotent graph of an Artinian ring. We prove that if Γw(R) is a forest, then Γw(R) is a union of a star and some isolated vertices. We study the clique number, the chromatic number, and the independence number of Γw(R). Among other results, we show that for an Artinian ring R, Γw(R) is not a disjoint union of cycles or a unicyclic graph. For Artinan rings, we determine diam . Finally, we characterize all commutative rings R for which is a cycle, where is the complement of the weakly nilpotent graph of R.

The zero-divisor graph of a commutative ring R with unity is the graph Γ(R) whose vertex set is the set of nonzero zero divisors of R, where two vertices are adjacent if and only if their product in R is zero. A vertex coloring c : V (G) → ℕ of a non-trivial connected graph G is called a sigma coloring if σ(u) = σ(ν) for any pair of adjacent vertices u and v. Here, σ(χ) denotes the sum of the colors assigned to vertices adjacent to x. The sigma chromatic number of G, denoted by σ(G), is defined as the least number of colors needed to construct a sigma coloring of G. In this paper, we analyze the structure of the zero-divisor graph of rings ℤn, where n = pn1 1 P2 n2 …Pm nm, where m,ni,n2, …,nm are positive integers and p1,p2, …,pm are distinct primes. The analysis is carried out by partitioning the vertex set of such zero-divisor graphs and analyzing the adjacencies, cardinality, and the degree of the vertices in each set of the partition. Using these properties, we determine the sigma chromatic number of these zero-divisor graphs.

It was shown by C. Wickham [12] that “for a fixed positive integer g, there are finitely many isomorphism classes of finite commutative rings whose zero-divisor graph has genus g.” In this note, we give a short direct proof for this result. Moreover, we show that, if the zero-divisor graph of a commutative ring R has finite genus g, then either g = 0 or R is a finite ring. This immediately generalizes Wickham's theorem to arbitrary (not necessary finite) commutative rings.

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.

Chemical graph theory is a branch of mathematical chemistry which deals with the non-trivial applications of graph theory to solve molecular problems. Graphs containing finite commutative rings also have wide applications in robotics, information and communication theory, elliptic curve cryptography, physics, and statistics. In this paper we discuss eccentric topological indices of zero divisor graphs of commutative rings Z p 1 p 2 × Z q , where p 1 , p 2 , and q are primes. To enhance the importance of these indices a construction algorithm is also devised for zero divisor graphs of commutative rings Z p 1 p 2 × Z q .

On the coloring of the annihilating-ideal graph of a commutative ring

Consider the (p,q) simple connected graph . The sum absolute values of the spectrum of quotient matrix of a graph make up the graph's quotient energy. The objective of this study is to examine the quotient energy of identity graphs and zero-divisor graphs of commutative rings using group theory, graph theory, and applications. In this study, the identity graphs derived from the group and a few classes of zero-divisor graphs of the commutative ring R are examined.

Let [Formula: see text], [Formula: see text], [Formula: see text] denote the zero-divisor graph, compressed zero-divisor graph and annihilating ideal graph of a commutative ring [Formula: see text], respectively. In this paper, we prove that [Formula: see text] for a semisimple commutative ring [Formula: see text] and represent [Formula: see text] as a generalized join of a finite set of graphs. Further, we study the zero-divisor graph of a semisimple group-ring [Formula: see text] and proved several structural properties of [Formula: see text] and [Formula: see text], where [Formula: see text] is a field with [Formula: see text] elements and [Formula: see text] is a cyclic group with [Formula: see text] elements.

For a graph G(V, E) with order n ≥ 2, the locating code of a vertex v is a finite vector representing distances of v with respect to vertices of some ordered subset W of V(G). The set W is a locating set of G(V, E) if distinct vertices have distinct codes. A locating set containing a minimum number of vertices is a minimum locating set for G(V, E). The locating number denoted by loc (G) is the number of vertices in the minimum locating set. Let R be a commutative ring with identity 1 ≠ 0, the zero-divisor graph denoted by Γ(R), is the (undirected) graph whose vertices are the nonzero zero-divisors of R with two distinct vertices joined by an edge when the product of vertices is zero. We introduce and investigate locating numbers in zero-divisor graphs of a commutative ring R. We then extend our definition to study and characterize the locating numbers of an ideal based zero-divisor graph of a commutative ring R.

Let R be a commutative ring with identity and A(R) be the set of ideals with nonzero annihilator. The annihilating-ideal graph of R is defined as the graph AG(R) with the vertex set A(R)* = A(R)\{0} and two distinct vertices I and J are adjacent if and only if IJ = 0. In this paper, we study the domination number of AG(R) and some connections between the domination numbers of annihilating-ideal graphs and zero-divisor graphs are given.