The vertex-connectivity and edge-connectivity of the zero-divisor graph associated to a finite commutative ring are studied. It is shown that the edgeconnectivity of ΓR always coincides with the minimum degree. When R is not local, it is shown that the vertex-connectivity also equals the minimum degree, and when R is local, various upper and lower bounds are given for the vertex-connectivity.

In this article we discuss the graphs of the sets of zero-divisors of a ring. Now let R be a ring. Let G be a graph with elements of R as vertices such that two non-zero elements a, b ∈ R are adjacent if ab = ba = 0. We examine such a graph and try to find out when such a graph is planar and when is it complete etc. Mathematics Subject Classification: Primary 16-xx, 05-xx; Secondary 05C50

Let N be a near-ring. In this paper, we associate a graph corresponding to the 3-prime radical I of N , denoted by ΓI(N). Further we obtain certain topological properties of Spec(N), the spectrum of 3-prime ideals of N and graph theoretic properties of ΓI(N). Using these properties, we discuss dominating sets and connected dominating sets of ΓI(N).

In this paper, we study some operations which produce new divisor graphs from old ones. We prove that the contraction of a divisor graph along a bridge is a divisor graph. For two transmitters (receivers) u and v in some divisor orientation of a divisor graph G, it is shown that the merger G |u,v is also a divisor graph. Two special types of vertex splitting are introduced, one of which produce...

A topological index is a numeric quantity associated with chemical structure that attempts to link the various physicochemical properties, reactivity, or biological activity. Let R be commutative ring identity, and Z*(R) set of all non-zero zero divisors R. Then, Γ(R) said zero-divisor graph if only a·b=0, where a,b∈V(Γ(R))=Z*(R) (a,b)∈E(Γ(R)). We define a∼b a·b=0 a=b. ∼ always reflexive symmet...

Let G = (V, E) be a graph with p vertices and q edges. A has product-set labeling if there exist an injective function f: V(G) → P (N) such that the induced edge f∗: P(N) is defined as f∗ (μν) f (μ) ∗ (ν) ∀μ, ν ∈ E(G).f {ab: (μ), b }. In this paper we investigate how works for zero-divisor line of graphs.