Tuijin Jishu/Journal of Propulsion Technology

ISSN: 1001-4055
Vol. 44 No. 3 (2023)
__________________________________________________________________________________________

Gamma Graph 𝚪(𝒁𝒏 )(𝜸) Of Zero Divisor Graph Of

A Finite Commutative Ring 𝒁𝒏
[1]
Sheeja C, [ 2 ] Nidha D
[1]
Research Scholar [Reg.No:20213112092014], 2Assistant Professor 1,2Research Department of
Mathematics, Nesamony Memorial Christian College, Marthandam - 629 165, Tamil Nadu, India.
[1] [2]
Affiliated to Manonmaniam Sundaranar University, Abishekapatti, Tirunelveli - 627 012, Tamil
Nadu, India.
∗Coressponding author: [1][email protected] , [2][email protected]

Abstract: Consider the family of γ-sets of a zero-divisor graph Γ(𝑍𝑛 ) of finite commutative ring and
d e f i n e t h e γ g r a p h s Γ(𝑍𝑛 ) (γ) = (𝑉(𝛾), 𝐸(𝛾) ) o f Γ(𝑍𝑛 ) to be the graph whose vertice V(γ)
corresponds 1-to-1 with the γ-sets , say S1 and S2, form an edge in E(γ) if there exist a vertex v𝑆1 such that
(i)v is adjacent to 𝑤 and (ii) 𝑆1 = 𝑆2 − {𝑤} ∪ {𝑢} and 𝑆2 = 𝑆1 − {𝑢} ∪ {𝑤}. Using this
definition, we investigate the interplay between the graph theoretic properties of Γ(𝑍𝑛 )(𝛾) and Γ(𝑍𝑛 )(𝛾)
and the ring theoretic properties of 𝑍𝑛 . Further, we prove that Γ(𝑍𝑛 )(𝛾) are an Eulerian and Hamiltonian.

Keywords: F i n i t e Commutative Ring, Zero-divisors, Zero-divisor graph, gamma sets, gamma graph.

Mathematical Classification: 05C25, 05C69

1. Introduction
The study of algebraic structures, using the properties of graph, become an exciting research topic in
the past twenty years, leading to many fascinating results and questions. In the literature, there are many papers
assigning graphs to rings, groups and semigroups. Let 𝑅 be a commutative ring with identity and 𝑍(𝑅)∗ be the
set of all non-zero zero-divisors of 𝑅. D.F. Anderson and P.S. Livingston[1], associates a graph called zero-
divisor graph 𝛤(𝑅) to 𝑅 with vertex set 𝑍(𝑅)∗ and for any two distinct 𝑥, 𝑦 ∈ 𝑍(𝑅)∗ , the vertices 𝑥 and 𝑦 are
adjacent if and only if 𝑥𝑦 = 0 in 𝑅.
For 𝑣 ∈ 𝑉, the associate class of 𝑣 is defined as 𝐴𝑣 = {𝑢𝑣: 𝑢 𝑖𝑠 𝑢𝑛𝑖𝑡 𝑖𝑛 𝑅}. Let 𝑛=
𝑘1 𝑘2 𝑘3 𝑘𝑟
𝑝1 𝑝2 𝑝3 … 𝑝𝑟 , where 𝑝1 , 𝑝2 , … , 𝑝𝑟 are primes with 𝑝1 < 𝑝2 < ⋯ < 𝑝𝑟 and 𝑘1 , 𝑘2 , … , 𝑘𝑟 are positive
integers. Then the set of all non-zero zero- divisors in 𝑍𝑛 , the ring of
𝑛
congruent modulo classes is given by 𝑍(𝑍𝑛 )∗ = {𝜆𝑖 𝑝𝑖 : 1 ≤ 𝜆𝑖 ≤ , 1≤𝑖≤
𝑝𝑖

𝑟}.
A set 𝐷 ⊆ 𝑉 of vertices of vertices in a graph 𝐺 = (𝑉, 𝐸) is called a dominating set if for every vertex
𝑢 ∈ 𝑉 − 𝐷,there exists a vertex 𝑣 ∈ 𝐷 such that 𝑣 is adjacent to 𝑢. A dominating set 𝐷 is minimal if no proper
subset 𝐷 is a dominating set. The domination number of a graph 𝐺, denoted by 𝛾(𝐺), is the minimum
cardinality of a minimal dominating set of 𝐺. A dominating set 𝐷 in a graph 𝐺 with cardinality 𝛾 is called 𝛾 −
set of 𝐺.
A path that contains every vertex of 𝐺 is called a Hamilton path of 𝐺. A Hamilton cycle of 𝐺 is a cycle
that contains every vertex of 𝐺. A graph is Hamiltonian if it contains a Hamilton cycle. A closed trial containing
all points and lines is called an Eulerian trial. A graph having an Eulerian trial is called an Eulerian graph. A
graph of size 0 is called an empty graph and so a nonempty graph has one or more edges. A graph is said to be a
self-centered graph if the eccentricity of every vertex of the graph is the same.

Definition 1.1: [3] Consider the family of 𝛾-sets of a graph 𝐺 and define the 𝛾−
graphs 𝐺(𝛾) = (𝑉 (𝛾), 𝐸(𝛾)) of 𝐺 to be the graph whose vertices 𝑉(𝛾) correspond 1-to-1 with the 𝛾 -
sets of 𝐺, and two 𝛾 sets, say 𝑆1 and 𝑆2 , form an edge in 𝐸(𝛾) if there exists a vertex 𝑣 ∈ 𝑆1 and a
vertex 𝑤 ∈ 𝑆2 such that

4164
Tuijin Jishu/Journal of Propulsion Technology
ISSN: 1001-4055
Vol. 44 No. 3 (2023)
__________________________________________________________________________________________

(i) 𝑣 is adjacent to 𝑤 and

(ii) 𝑆1 = 𝑆2 − {𝑤} ∪ {𝑣} and 𝑆2 = 𝑆1 − {𝑣} ∪ {𝑤}.
Looking at all these, we are very much interested to introduce a definition Gamma Graph Γ(𝑍𝑛 )(𝛾)
of Zero divisor graph of a finite Commutative Ring 𝑍𝑛 .
The following results are used in the subsequent section.

Remark 1.2:[5] Let 𝑛 = 𝑝1 𝑘1 𝑝2 𝑘2 𝑝3 𝑘3 … 𝑝𝑟 𝑘𝑟 , where 𝑟 ≥ 1, 𝑝1 , 𝑝2 , … , 𝑝𝑟 are primes with 𝑝1 < 𝑝2 < ⋯ <
𝑝𝑟 and 𝑛 ≠ 2𝑝, 𝑛 ≠ 3𝑝, 𝑝 > 3 is prime. Then the number of 𝛾 − sets in Γ(𝑍𝑛 ) is ∏𝑟𝑖=1(𝑝𝑖 − 1).

Note 1.3:[5] Let 𝑛 = 𝑝1 𝑘1 𝑝2 𝑘2 𝑝3 𝑘3 … 𝑝𝑟 𝑘𝑟 , where 𝑟 ≥ 1, 𝑝1 , 𝑝2 , … , 𝑝𝑟 are primes with 𝑝1 < 𝑝2 < ⋯ <
𝑝𝑟 and 𝑛 = 3𝑝, 𝑝 > 3 is prime. Then the number of 𝛾 − sets in Γ(𝑍𝑛 ) is ∏𝑟𝑖=1(𝑝𝑖 − 1) + 1.

Note 1.4: [5] Let 𝑛 = 𝑝1 𝑘1 𝑝2 𝑘2 𝑝3 𝑘3 … 𝑝𝑟 𝑘𝑟 , where 𝑟 ≥ 1, 𝑝1 , 𝑝2 , … , 𝑝𝑟 are primes with 𝑝1 < 𝑝2 < ⋯ <
𝑝𝑟 and 𝑛 = 2𝑝, 𝑝 > 3 is prime. Then the number of 𝛾 − sets in Γ(𝑍𝑛 ) is 1.

Corollary 1.5:[5] Let 𝑛 = 𝑝1 𝑘1 𝑝2 𝑘2 𝑝3 𝑘3 … 𝑝𝑟 𝑘𝑟 , where 𝑟 ≥ 1, 𝑝1 , 𝑝2 , … , 𝑝𝑟 are primes with 𝑝1 < 𝑝2 < ⋯ <
𝑝𝑟 and 𝑛 ≠ 2𝑝, 𝑝 ≥ 3 is prime, then 𝛾(Γ(𝑍𝑛 )) = 𝑟.

Throughout this paper, 𝑛 is a fixed positive integer and not a prime number,
𝑍𝑛 = {0,1,2,3, … , 𝑛 − 1}, Γ(𝑍𝑛 ) is the Zero-divisor graph of 𝑍𝑛 , Γ(𝑍𝑛 )(𝛾) is the gamma graph of Γ(𝑍𝑛 ) and
𝑉 = 𝑉(Γ(𝑍𝑛 )(𝛾)) is the vertex set of Γ(𝑍𝑛 )(𝛾). Here we introduced a new definition, gamma graph of a
zero - divisor graph Γ(𝑍𝑛 )(𝛾) of a finite commutative ring 𝑍𝑛 .

2. Gamma Graph 𝚪(𝒁𝒏 )(𝜸) of Zero divisor graph

In this section, we introduced a new definition, gamma graph of a zero-divisor graph Γ(𝑍𝑛 )(𝛾) of
a finite commutative ring 𝑍𝑛 .

Definition 2.1: Consider the family of 𝛾-sets of a z e r o - d i v i s o r graph Γ(𝑍𝑛 ) o f f i n i t e

c o m m u t a t i v e r i n g 𝑍𝑛 and define the 𝛾 − graphs Γ(𝑍𝑛 )(𝛾) = (𝑉 (𝛾), 𝐸(𝛾)) of Γ(𝑍𝑛 ) to be the
graph whose vertices 𝑉(𝛾) correspond 1-to-1 with the 𝛾 - sets of 𝐺, and two 𝛾 sets, say 𝑆1 and 𝑆2 ,
form an edge in 𝐸(𝛾) if there exists a vertex 𝑣 ∈ 𝑆1 and a vertex 𝑤 ∈ 𝑆2 such that
(i) 𝑣 is adjacent to 𝑤 and
(ii) 𝑆1 = 𝑆2 − {𝑤} ∪ {𝑣} and 𝑆2 = 𝑆1 − {𝑣} ∪ {𝑤}.

With this definition, two 𝛾-sets are said to be adjacent if they differ by one vertex and the two vertices
defining this difference are adjacent Γ(𝑍𝑛 ).

Example 2.2: Consider the ring 𝑍15 .

𝑍15 = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14}
𝑍(𝑍15 )∗ = {3,5,6,9,10,12}
The zero-divisor graph 𝛤(𝑍15 ):

4165
Tuijin Jishu/Journal of Propulsion Technology
ISSN: 1001-4055
Vol. 44 No. 3 (2023)
__________________________________________________________________________________________

5 10

3 6 9 12
Fig 1: 𝛤(𝑍15 )

The 𝛾- sets are 𝐷1 = {5,10 }, 𝐷2 = {5,3}, 𝐷3 = {5,6},

𝐷4 = {5,9}, 𝐷5 = {5,12}, 𝐷6 = {10,3},
𝐷7 = {10,6}, 𝐷8 = {10,9}, 𝐷9 = {10,12}

The gamma graph 𝛤(𝑍15 )(𝛾):

D1

D2 D3 D4 D5 D6 D7 D8 D9

Fig 2: 𝛤(𝑍15 )(𝛾)

3. Basic properties of the gamma graph 𝚪(𝒁𝒏 )(𝜸)

In this section, we study some basic properties of gamma graph of a zero - divisor graph Γ(𝑍𝑛 ) of a
finite commutative ring 𝑍𝑛 and the same is denoted by Γ(𝑍𝑛 )(𝛾). Actually, We find the diameter and girth of
Γ(𝑍𝑛 )(𝛾). Also, we characterize, when Γ(𝑍𝑛 )(𝛾) is planar, empty graph, Self- centered graph and the
Γ(𝑍𝑛 )(𝛾) is connected. Also, we find the Eulerian and Hamiltonian nature of Γ(𝑍𝑛 )(𝛾). First we start the
section with the degree of each vertex of the new graph Γ(𝑍𝑛 )(𝛾).

Theorem 3.1 : Let 𝑛 = 𝑝1 𝑘1 𝑝2 𝑘2 𝑝3 𝑘3 … 𝑝𝑟 𝑘𝑟 , where 𝑟 > 1, 𝑘1 , 𝑘2 , … , 𝑘𝑟 > 1 and 𝑝1 , 𝑝2 , … , 𝑝𝑟 are primes with
𝑝1 < 𝑝2 < ⋯ < 𝑝𝑟 and 𝑛 ≠ 2𝑝, 3𝑝, 𝑝 > 3 is a prime. For any 𝑣 ∈ 𝑉, deg Γ(𝑍𝑛 )(𝛾) (𝑣) =
𝑟
∑𝑖=1(𝑝𝑖 − 1) − 𝛾(Γ(𝑍𝑛 )) and hence Γ(𝑍𝑛 )(𝛾) is a regular graph.

Proof: Let 𝑣 = {{𝑎1 , 𝑎2 , … , 𝑎𝑟 }, 𝑓𝑜𝑟 𝑠𝑜𝑚𝑒 𝑎𝑖 ∈ 𝐴 𝑛 , 1 ≤ 𝑖 ≤ 𝑟} be a vertex in

𝑝𝑖

𝑉 = 𝑉(Γ(𝑍𝑛 )(𝛾)). Take 𝑁[𝑣] = 𝑉 − {{𝑏1 , 𝑏2 , … , 𝑏𝑟 }: 𝑎𝑖 = 𝑏𝑖 , 1 ≤ 𝑖 ≤ 𝑟 − 1, 𝑏𝑖 ∈ 𝐴 𝑛 , 1 ≤ 𝑖 ≤

𝑝𝑖

𝑟, 𝑎𝑟 and 𝑏𝑟 are adjacent} . Thus, deg Γ(𝑍𝑛)(𝛾) (𝑣) = ∑𝑟𝑖=1(𝑝𝑖 − 1) − 𝛾(Γ(𝑍𝑛 )) and hence Γ(𝑍𝑛 )(𝛾) is a regular
graph.

Corollary 3.2. Let 𝑛 = 𝑝1 𝑘1 𝑝2 𝑘2 𝑝3 𝑘3 … 𝑝𝑟 𝑘𝑟 , where 𝑟 > 1, 𝑘1 , 𝑘2 , … , 𝑘𝑟 > 1 and 𝑝1 , 𝑝2 , … , 𝑝𝑟 are primes with
𝑝1 < 𝑝2 < ⋯ < 𝑝𝑟 and 𝑛 ≠ 2𝑝, 3𝑝, 𝑝 > 3 is a prime. Then

4166
Tuijin Jishu/Journal of Propulsion Technology
ISSN: 1001-4055
Vol. 44 No. 3 (2023)
__________________________________________________________________________________________

1. Γ(𝑍𝑛 )(𝛾) is connected.

2. 𝑑𝑖𝑎𝑚(Γ(𝑍𝑛 )(𝛾)) ≤ 2.
3. 𝑔𝑟(Γ(𝑍𝑛 )(𝛾)) = 3
Proof: The Corollary follows from the above theorem.

Proposition 3.3 : Let 𝑛 = 𝑝1 𝑘1 𝑝2 𝑘2 𝑝3 𝑘3 … 𝑝𝑟 𝑘𝑟 , where 𝑟 > 1, 𝑘1 , 𝑘2 , … , 𝑘𝑟 > 1 and 𝑝1 , 𝑝2 , … , 𝑝𝑟 are primes

with 𝑝1 < 𝑝2 < ⋯ < 𝑝𝑟 and 𝑛 ≠ 2𝑝, 3𝑝, 𝑝 > 3 is a prime. Then Γ(𝑍𝑛 )(𝛾) is a self-centered graph.
Proof: If n = pk or n = 2k1 p k2 , where 𝑝 is a prime number, p > 3 and 𝑘 ≥ 2,
𝑘1 , 𝑘2 > 1, then Γ(𝑍𝑛 )(𝛾) is a complete graph and 𝑒(𝑣) = 1, for all 𝑣 ∈ 𝑉(Γ(𝑍𝑛 )(𝛾)). Therefore Γ(𝑍𝑛 )(𝛾) is
a self-centered graph.

If n ≠ pk or n ≠ 2k1 pk2 , where 𝑝 is a prime number, p > 3 and 𝑘 ≥ 2,

𝑘1 , 𝑘2 > 1, then Γ(𝑍𝑛 )(𝛾) is not a complete graph. Since Γ(𝑍𝑛 )(𝛾) is not a complete graph, then deg(𝑣) <
|𝑉(Γ(𝑍𝑛 )(𝛾))| − 1, for all 𝑣 ∈ 𝑉(Γ(𝑍𝑛 )(𝛾)). By corollary 3.2, 𝑑𝑖𝑎𝑚(Γ(𝑍𝑛 )(𝛾)) ≤ 2 and so 𝑒(𝑣) =
2. Hence Γ(𝑍𝑛 )(𝛾) is a self-centered graph

Proposition 3.4 : Let 𝑛 = 𝑝1 𝑘1 𝑝2 𝑘2 𝑝3 𝑘3 … 𝑝𝑟 𝑘𝑟 , where 𝑟 > 1, 𝑘1 , 𝑘2 , … , 𝑘𝑟 > 1 and 𝑝1 , 𝑝2 , … , 𝑝𝑟 are primes

with 𝑝1 < 𝑝2 < ⋯ < 𝑝𝑟 and 𝑛 ≠ 2𝑝, 3𝑝, 𝑝 > 3 is a prime. Then Γ(𝑍𝑛 )(𝛾) is Hamiltonian.
Theorem 3.5 : Let 𝑛 = 𝑝1 𝑘1 𝑝2 𝑘2 𝑝3 𝑘3 … 𝑝𝑟 𝑘𝑟 , where 𝑟 > 1, 𝑘1 , 𝑘2 , … , 𝑘𝑟 > 1 and 𝑝1 , 𝑝2 , … , 𝑝𝑟 are primes with
𝑝1 < 𝑝2 < ⋯ < 𝑝𝑟 and 𝑛 ≠ 2𝑝, 3𝑝, 𝑝 > 3 is a prime. Then Γ(𝑍𝑛 )(𝛾) is Eulerian if and only if 𝑛 is even and
𝛾(Γ(𝑍𝑛 )) is odd or 𝑛 is odd and 𝛾(Γ(𝑍𝑛 )) is even.
Proof: We know that deg Γ(𝑍𝑛)(𝛾) (𝑣) = ∑𝑟𝑖=1(𝑝𝑖 − 1) − 𝛾(Γ(𝑍𝑛 )).
Case(i). 𝑛 is even and 𝛾(Γ(𝑍𝑛 )) is even.
If 𝑛 is even, ∑𝑟𝑖=1(𝑝𝑖 − 1) is odd. Since 𝛾(Γ(𝑍𝑛 )) is even, deg Γ(𝑍𝑛 )(𝛾) (𝑣) is odd.
Then Γ(𝑍𝑛 )(𝛾) is not Eulerian.
Case(ii). 𝑛 is odd and 𝛾(Γ(𝑍𝑛 )) is odd.
If 𝑛 is odd, ∑𝑟𝑖=1(𝑝𝑖 − 1)is even. Since 𝛾(Γ(𝑍𝑛 )) is odd, deg Γ(𝑍𝑛)(𝛾) (𝑣) is odd.
Then Γ(𝑍𝑛 )(𝛾) is not Eulerian.
Case(iii). 𝑛 is even and 𝛾(Γ(𝑍𝑛 )) is odd.
If 𝑛 is even, ∑𝑟𝑖=1(𝑝𝑖 − 1)is odd. Since 𝛾(Γ(𝑍𝑛 )) is odd, deg Γ(𝑍𝑛 )(𝛾) (𝑣) is even. Then Γ(𝑍𝑛 )(𝛾) is
Eulerian.
Case(iv). 𝑛 is odd and 𝛾(Γ(𝑍𝑛 )) is even.
If 𝑛 is odd, ∑𝑟𝑖=1(𝑝𝑖 − 1)is even. Since 𝛾(Γ(𝑍𝑛 )) is even, deg Γ(𝑍𝑛)(𝛾) (𝑣) is even. Then Γ(𝑍𝑛 )(𝛾) is
Eulerian.
Combining all the four cases, we have Γ(𝑍𝑛 )(𝛾) is Eulerian if and only if 𝑛 is even and 𝛾(Γ(𝑍𝑛 )) is
odd or 𝑛 is odd and 𝛾(Γ(𝑍𝑛 )) is even.

Theorem 3.6: Let 𝑛 = 𝑝1 𝑘1 𝑝2 𝑘2 𝑝3 𝑘3 … 𝑝𝑟 𝑘𝑟 , where 𝑟 > 1, 𝑘1 , 𝑘2 , … , 𝑘𝑟 = 1 and 𝑝1 , 𝑝2 , … , 𝑝𝑟 are primes with

𝑝1 < 𝑝2 < ⋯ < 𝑝𝑟 . Then Γ(𝑍𝑛 )(𝛾) is planar if and only if
𝑛 = 𝑝𝑘 , 𝑝 ≤ 5 or 𝑛 = 2𝑘1 𝑝𝑘2 , 3 ≤ 𝑝 ≤ 5 or 𝑛 = 2𝑝, 𝑝 ≥ 3, where 𝑝 is a prime.
Proof: If 𝑛 = 2𝑘 or 𝑛 = 2𝑝, 𝑝 ≥ 3 and 𝑝 is a prime, then Γ(𝑍𝑛 )(𝛾) = 𝐾1 . If 𝑛 = 3𝑘 or
𝑛 = 2𝑘1 3𝑘2 , then Γ(𝑍𝑛 )(𝛾) = 𝐾2 . If n=5𝑘 or 𝑛 = 2𝑘1 5𝑘2 , then Γ(𝑍𝑛 )(𝛾) = 𝐾4 . In all the cases, then Γ(𝑍𝑛 )(𝛾)
is a planar graph.
Conversely, Assume that then Γ(𝑍𝑛 )(𝛾) is a planar graph. If Γ(𝑍𝑛 )(𝛾) = 𝐾1 , then n=2𝑘 or 𝑛 =
2𝑝, 𝑝 ≥ 3 and 𝑝 is a prime and 𝑘 > 1. Also, if Γ(𝑍𝑛 )(𝛾) = 𝐾𝑝−1 , then by a theorem [7], 𝑛 = 𝑝𝑘 or 𝑛 = 2𝑘1 𝑝𝑘2 .
We claim that 𝑝 ≤ 5. If 𝑝 > 5, then Γ(𝑍𝑛 )(𝛾) is a complete graph with at least 6 vertices, which is a
contradiction to Γ(𝑍𝑛 )(𝛾) is a planar graph. Therefore, 𝑝 ≤ 5. Thus, n=3𝑘 or 𝑛 = 2𝑘1 3𝑘2 or n=5𝑘 or 𝑛 =
2𝑘1 5𝑘2 . We claim that 𝑟 = 2. Suppose 𝑟 > 2. Then |𝑉| ≥ 8. As in the proof of theorem [7], 𝐾5 is a subgraph
of Γ(𝑍𝑛 )(𝛾), a contradiction. Hence 𝑟 = 2 and so 𝑛 = 𝑝1 𝑘1 𝑝2 𝑘2 . We claim that 𝑝1 = 2. If not, 𝑛 is odd. When

4167
Tuijin Jishu/Journal of Propulsion Technology
ISSN: 1001-4055
Vol. 44 No. 3 (2023)
__________________________________________________________________________________________

𝑝1 > 3, 𝑝2 > 5, then 𝐾5 is a subgraph of Γ(𝑍𝑛 )(𝛾), a contradiction. When 𝑝1 = 3, 𝑝2 = 5, then Γ(𝑍𝑛 )(𝛾) =
𝐾3 𝐾4 is non-planar, a contradiction. Thus 𝑛 is even and so 𝑝1 = 3. If 𝑝2 ≥ 7, then 𝐾5 is a subgraph of
Γ(𝑍𝑛 )(𝛾), a contradiction. Therefore, 𝑛 = 𝑝𝑘 , 𝑝 ≤ 5 or 𝑛 = 2𝑘1 𝑝𝑘2 , 3 ≤ 𝑝 ≤ 5 or 𝑛 = 2𝑝, 𝑝 ≥ 3, where 𝑝 is
a prime.

Theorem 3.7: Let 𝑛 = 𝑝1 𝑘1 𝑝2 𝑘2 𝑝3 𝑘3 … 𝑝𝑟 𝑘𝑟 , where 𝑟 > 1, 𝑘1 , 𝑘2 , … , 𝑘𝑟 = 1 and 𝑝1 , 𝑝2 , … , 𝑝𝑟 are primes with

𝑝1 < 𝑝2 < ⋯ < 𝑝𝑟 and 𝑛 ≠ 3𝑝, 𝑝𝑘 , 2𝑘1 𝑝 𝑘2 𝑝 > 3 is a prime. Then Γ(𝑍𝑛 )(𝛾) is a empty graph.
Proof: Let 𝑢, 𝑣 ∈ 𝑉(Γ(𝑍𝑛 )(𝛾)) with 𝑢 ≠ 𝑣. Then 𝑢 = {𝑎1 , 𝑎2 , … , 𝑎𝑟 } and 𝑣=
{𝑏1 , 𝑏2 , … , 𝑏𝑟 }, for some 𝑎𝑖 , 𝑏𝑖 ∈ 𝐴 𝑛 , for 𝑖 = 1,2, … , 𝑟. Using the definition 2.1, 𝑢 and 𝑣 satisfies first
𝑝𝑖

condition that is 𝑎𝑖 = 𝑏𝑖 , 1 ≤ 𝑖 ≤ 𝑟 − 1. But the second condition, 𝑎𝑟 and 𝑏𝑟 are adjacent is not satisfied. So,
there is ∏𝑟𝑖=1(𝑝𝑖 − 1) vertices and no edges in Γ(𝑍𝑛 )(𝛾). Thus, Γ(𝑍𝑛 )(𝛾) is a empty graph.

Corollary 3.8. Let 𝑛 = 𝑝1 𝑘1 𝑝2 𝑘2 𝑝3 𝑘3 … 𝑝𝑟 𝑘𝑟 , where 𝑟 > 1, 𝑘1 , 𝑘2 , … , 𝑘𝑟 = 1 and 𝑝1 , 𝑝2 , … , 𝑝𝑟 are primes with

𝑝1 < 𝑝2 < ⋯ < 𝑝𝑟 and 𝑛 ≠ 2𝑝, 3𝑝, 𝑝 > 3 is a prime. Then
1. 𝑑𝑖𝑎𝑚(Γ(𝑍𝑛 )(𝛾)) = ∞.
2. 𝑔𝑟(Γ(𝑍𝑛 )(𝛾)) = ∞
3. deg(Γ(𝑍𝑛 )(𝛾)) = 0.
4. Γ(𝑍𝑛 )(𝛾) is non Hamiltonian.
5. Γ(𝑍𝑛 )(𝛾) is not Eulerian.
6. 𝜔(Γ(𝑍𝑛 )(𝛾)) = 1.
7. 𝜒(Γ(𝑍𝑛 )(𝛾)) = 1.
Proof: The Corollary follows from the above theorem.

Theorem 3.9. Let be a positive integer and not a prime number. Then Γ(𝑍𝑛 )(𝛾) = 𝐾1,2(𝑝−1) if and only if

𝑛 = 3𝑝 , where 𝑝 > 3 is a prime number

Proof: Assume that , where is a prime number Then Γ(𝑍𝑛 )(𝛾) = 𝐾2,(𝑝−1) . and so

𝛾(Γ(𝑍𝑛 )) = 2. Also, the number of sets is 2(p-1)+1. Join the vertices that satisfy the two gamma

graph Γ(𝑍𝑛 )(𝛾) conditions. Then we get , Γ(𝑍𝑛 )(𝛾) = 𝐾1,2(𝑝−1) . The converse part is trivial.

Corollary 3.10. Let 𝑛 = 𝑝1 𝑘1 𝑝2 𝑘2 𝑝3 𝑘3 … 𝑝𝑟 𝑘𝑟 , where 𝑟 > 1, 𝑘1 , 𝑘2 , … , 𝑘𝑟 = 1 and 𝑝1 , 𝑝2 , … , 𝑝𝑟 are primes with

𝑝1 < 𝑝2 < ⋯ < 𝑝𝑟 and 𝑛 ≠ 2𝑝, 3𝑝, 𝑝 > 3 is a prime. Then
1. 𝑑𝑖𝑎𝑚(Γ(𝑍𝑛 )(𝛾)) = 2.
2. 𝑔𝑟(Γ(𝑍𝑛 )(𝛾)) = ∞
3. deg(Γ(𝑍𝑛 )(𝛾)) = 2(𝑝 − 1).
4. Γ(𝑍𝑛 )(𝛾) is non Hamiltonian.
5. Γ(𝑍𝑛 )(𝛾) is not Eulerian.
6. 𝜔(Γ(𝑍𝑛 )(𝛾)) = 2.
7. 𝜒(Γ(𝑍𝑛 )(𝛾)) = 2.
Proof: The Corollary follows from the above theorem.

4. Conclusions
In this paper, we have to find some basic properties on Gamma Graph of a Zero-divisor graph
. Further, we can find the value of the independent number, clique number, the chromatic Number,

the connectivity and some domination parameters of . Also, we have to find the gamma graph of

4168
Tuijin Jishu/Journal of Propulsion Technology
ISSN: 1001-4055
Vol. 44 No. 3 (2023)
__________________________________________________________________________________________

Total graph and its basic properties.

References
[1] Anderson D.F, Livingston P.S. The Zero-divisor graph of a Commutative ring. J. Algebra ,217:434-
447, 1999. DOI:10.1006/jabr.1998.7840.
[2] Aparna Lakshmanan S and Vijaya Kumar A, The Gamma Graph of a Graph, AKCE
International Journal of Graphs and Combinatorics, No.1, 53-59,2010, DOI:
10.1080/09728600.2010.12088911.
[3] Fricke G, Hedetniemi S.M, Hedetniemi S.T and. Hutson K. R, Graphs of Graphs,

Discuss .Math .Graph Theory 31517-531,2011

[4] Tamil Chelvam and K. Selva kumar ,On the intersection graph of gamma sets in the zero-divisor graph,
Discrete Mathematics, Algorithms and Applications, Vol.7, No.1 2015. DOI:
10.1142/S1793830914500670.
[5]. Tamil Chelvam and K. Selva kumar , Intersection graph of gamma sets in the zero-divisor, Journal of
Advanced Research in Pure Mathematics, Vol.4 Issue. 4, pp.57-66, 2012,
DOI:10.5373/jarpm.1183.112111.
[6]. C.Sheeja and D. Nidha, A note on gamma graph and intersection graph of a graph, Indian Journal of
pure and Applied Mathematics., Submitted.
[7]. C.Sheeja and D. Nidha, Gamma Graph of the Zero-divisor graph in a finite Commutative Ring.,
Submitted.

4169