• Tidak ada hasil yang ditemukan

On the genus of graphs from commutative rings

N/A
N/A
Protected

Academic year: 2025

Membagikan "On the genus of graphs from commutative rings"

Copied!
8
0
0

Teks penuh

(1)

Department of Mathematics, Manonmaniam Sundaranar University, Tirunelveli 627 012, Tamil Nadu, India Received 11 June 2015; accepted 27 May 2016

Available online xxxx

Abstract

LetRbe a commutative ring with non-zero identity. The cozero-divisor graph ofR, denoted byΓ(R), is a graph with vertex-set W(R), which is the set of all non-zero non-unit elements ofR, and two distinct verticesxand yinW(R)are adjacent if and only ifx ̸∈ R yandy̸∈ Rx, where forz∈ R,Rzis the ideal generated byz. In this paper, we determine all isomorphism classes of finite commutative ringsR with identity whoseΓ(R)has genus one. Also we characterize all non-local rings for which the reduced cozero-divisor graphΓr(R)is planar.

c

⃝2017 Publishing Services by Elsevier B.V. on behalf of Kalasalingam University. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).

Keywords:Genus; Local ring; Nilpotent; Planar graph

1. Introduction

The study of algebraic structures, using the properties of graphs, became 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 groups, semigroups and rings. In 1988, Beck began to investigate the possibility of coloring a commutative ringRby associating to the ring azero-divisor graph, defined as a simple graph, the vertices of which are the elements of the ring R, with two distinct elementsx and ybeing adjacent if and only if x y = 0 [1]. Retaining the original definition, the next decade brought little progress. However, in 1999, Anderson and Livingston [2] modified and studied the zero-divisor graphΓ(R)whose vertices are the nonzero zero-divisors Z(R) of the commutative ring R. In [3], Khashyarmanesh defined the cozero-divisor graph of commutative rings. The cozero-divisor graph of R, denoted byΓ(R), is a graph with vertex-set W(R), which is the set of all non-zero non-unit elements of R, and two distinct verticesx and yinW(R)are adjacent if and only if x ̸∈ R y andy ̸∈ Rx, where forz ∈ R, Rz is the ideal generated byz. In [3,4], some basic results on the structure of this graph were obtained. Also, in [5], the situation whereΓ(R)is planar, outer planar and ring graph is investigated. In [6], A. Wilkens et al. defined the reduced cozero-divisor graph of commutative rings. The reduced cozero-divisor graph of R, denoted byΓr(R), is a

Peer review under responsibility of Kalasalingam University.

Corresponding author.

E-mail addresses:[email protected](S. Kavitha),[email protected](R. Kala).

http://dx.doi.org/10.1016/j.akcej.2016.11.006

0972-8600/ c2017 Publishing Services by Elsevier B.V. on behalf of Kalasalingam University. This is an open access article under the CC BY- NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).

(2)

Rxand R yinΩ(R)are adjacent if and only if Rx ̸⊆ R y andR y ̸⊆ Rx. We denote the ring of integers modulon byZn, the field withq elements byFqand the set of all nilpotent elements inRbyN(R). Note thatR×is the set of all units in R. For any set X, letXdenote the nonzero elements of X. For basic definitions on rings, one may refer to [7].

LetSkdenote the sphere withkhandles, wherekis a nonnegative integer, that is,Skis an oriented surface of genus k. The genus of a graphG, denotedg(G), is the minimum integernsuch that the graph can be embedded inSn. For details on the notion of embedding a graph in a surface, see [8]. Intuitively,Gis embedded in a surface if it can be drawn in the surface so that its edges intersect only at their common vertices. A genus 0 graph is called a planar graph and a genus 1 graph is called a toroidal graph. We note here that ifHis a subgraph of a graphG, theng(H)≤g(G). LetGandHbe two graphs with disjoint vertex setsV1,V2and edge setsE1,E2respectively, theirjoinis denoted by G+Hand it consists ofG∪Hand all edges joining every vertex ofV1with every vertex ofV2. For basic definitions on graphs, one may refer [9]. The following results are useful for further reference in this paper.

Example 1.1 ([10,11]).Let(R,m)be a finite local ring Then

|m| R |R|

1 Z4,Z2x[x]2⟩ 4 2 Z9,Z3x[x]2⟩ 9 3 Z8,Z2x[x]3⟩,⟨2xZ,4x[x]2−2⟩ 8

Z4[x]

⟨2,x⟩2,Z2[x,y]

⟨x,y⟩2 8

F4[x]

x2⟩, ⟨x2Z+x+14[x] ⟩ 16 4 Z25,Z5x[x]2⟩ 25

Lemma 1.2. g(Kn)=(n−3)(n−4)

12

if n≥3. In particular, g(Kn)=1if n=5,6,7.

Lemma 1.3. g(Km,n)= (

m−2)(n−2) 4

if m,n ≥ 2. In particular, g(K4,4) = g(K3,n) =1 if n = 3,4,5,6. Also g(K5,4)=g(K6,4)=g(Km,3)=2if m=7,8,9,10.

Theorem 1.4. Let R be a finite commutative non-local ring. ThenΓ(R)is planar if and only if R is isomorphic to one of the following rings:Z2×Z2×Z2,Z2×F ,Z2×Z4,Z2×Z2[x]

x2⟩,Z3×F ,Z3×Z4, orZ3×Z2[x]

x2⟩, where F is a finite field.

(3)

Fig. 2.1. A planar embedding ofΓ(Z3×Z2×Z2)inS1.

2. Genus ofΓ(R)

In this section, we determine all isomorphism classes of finite commutative non-local rings with identity whose Γ(R)has genus one.

Theorem 2.1. Let R=F1× · · · ×Fnbe a finite commutative ring with identity, where each Fj is a field and n≥2.

Then g(Γ(R))=1if and only if R is isomorphic to one of the following rings:F4×F4,F4×Z5,Z5×Z5,F4×F7

orZ3×Z2×Z2.

Proof. Suppose g(Γ(R)) = 1. Suppose n ≥ 4. Let A = {x1,x2, . . . ,x11}, where x1 = (0,0,0,1,0, . . . ,0), x2 = (0,0,1,0, . . . ,0), x3 = (0,0,1,1,0, . . . ,0), x4 = (0,1,0, . . . ,0), x5 = (1,1,0,0. . . ,0), x6 = (1,0, ,0, . . . , . . . ,0), x7 = (0,1,1,1,0, . . . ,0), x8 = (0,1,1,0, . . . ,0), x9 = (1,0,0,1,0, . . . ,0), x10 = (1,0,1,0, . . . ,0), x11 = (1,0,1,1,0. . . ,0) ∈ W(R). Then the subgraph induced by A inΓ(R) contains G (seeFig. 1) as a subgraph and sog(Γ(R))≥2. Hencen≤3.

Case 1.n=2.

Note thatΓ(R)∼= K|F1|−1,|F2|−1. Sinceg(Γ(R))=1, byLemma 1.3,R is isomorphic to one of the following ringsF4×F4,F4×Z5,Z5×Z5orF4×F7.

Case 2.n=3.

Suppose at least two ofFi’s are such that|Fi| ≥ 3. Without loss of generality let|F1| ≥ 3 and|F2| ≥ 3. Let B= {z1, . . . ,z11}, wherez1=(1,0,0),z2=(1,1,0),z3=(1, v1,0),z4=(0,1,1),z5=(0, v1,1),z6=(0,0,1), z7=(0,1,0),z8=(0, v1,0),z9=(1,0,1),z10 =(u1,0,0),z11 =(u1,0,1), 1̸=u1∈F1, 1̸=v1∈ F2. Then the subgraph induced byBinΓ(R)containsG(seeFig. 1) as a subgraph and sog(Γ(R))≥2, a contradiction. Hence

|Fi| = |Fj| =2 for somei ̸= j. We assume thatF2=F3=Z2.

Suppose |F1| ≥ 4. Let B = {b1, . . . ,b11}, where b1 = (u1,0,1),b2 = (1,0,1),b3 = (u2,0,1), b4 = (u1,1,0),b5 = (0,1,0), b6 = (u2,1,0), b7 = (0,0,1),b8 = (0,1,1),b9 = (u2,0,0), b10 = (1,0,0), b11 = (u1,0,1) ∈ W(R)and 1 ̸= ui ∈ F1,i = 1,2. Then the subgraph induced by B inΓ(R)contains G (seeFig. 1) as a subgraph and so g(Γ(R)) ≥ 2, a contradiction. Hence|F1| ≤ 3. SinceΓ(R)is non-planar, by Theorem 1.4,R Z2×Z2×Z2and henceF1=Z3.

Converse follows fromLemma 1.3andFig. 2.1.

Remark 2.2. Note that if R = R1× · · · ×Rn be a commutative ring with identity, where each(Ri,mi)is a local ring withmi ̸= {0}andn ≥ 2, then Γ(Z4×Z4)is a subgraph ofΓ(R). Sinceg(Γ(Z4×Z4)) ≥ 2, we have g(Γ(R))≥2.

(4)

Fig. 2.2. A planar embedding ofΓ(Z9×Z2)andΓ

Z3[x]

x2 ×Z2

inS1.

Fig. 2.3. A planar embedding ofΓ(Z8×Z2)inS1.

Note thatΓ(Z8×Z2)∼=Γ(R), whereRis isomorphic to one of the following rings:Z2x[x]3⟩ ×Z2, ⟨2x,xZ4[x]2−2⟩×Z2,

Z4[x]

⟨2,x⟩2 ×Z2or Z2[x,y]

⟨x,y⟩2 ×Z2.

Theorem 2.3. Let R=R1× · · · ×Rn×F1× · · · ×Fm be a commutative ring with identity, where each(Ri,mi)is a local ring withmi ̸= {0}, Fj is a field and n,m≥ 1. Then g(Γ(R))=1if and only if R is isomorphic to one of the following rings:Z4×F4,Z2x[x]2⟩ ×F4,Z4×F5,Z2x[x]2⟩ ×F5,Z4×F7or Z2x[x]2⟩ ×F7,Z9×Z2,Z3x[x]2⟩ ×Z2,Z8×Z2,

Z2[x]

x3⟩ ×Z2, ⟨2xZ,4x[x]2−2⟩ ×Z2, Z4[x]

⟨2,x⟩2 ×Z2or Z2[x,y]

⟨x,y⟩2 ×Z2.

Proof. Assume thatg(Γ(R))=1. Supposen+m ≥3. LetΩ = {x1, . . . ,x11}, wherex1 =(1,0,0, . . . ,0),x2= (u,0,0, . . . ,0),x3 =(a,0,0, . . . ,0),x4=(0,0,1,0, . . . ,0),x5 =(0,1,0, . . . ,0),x6=(0,1,1,0, . . . ,0),x7 = (1,1,0, . . . ,0),x8 =(u,1,0, . . . ,0),x9=(1,0,1,0, . . . ,0),x10 =(u,0,1,0, . . . ,0),b11 =(a,0,1,0, . . . ,0)∈ W(R), 1̸=u ∈ R1×anda ∈m1. Then the subgraph induced byΩ inΓ(R)containsG(seeFig. 1) as a subgraph and sog(Γ(R))≥2, a contradiction. HenceR=R1×F1.

Suppose|F1| ≥ 3. If|m1| ≥ 2, then|R×1| ≥ 4. LetΩ1 = {(a,0), (b,0), (u1,0), (u2,0), (u3,0), (u4,0), (0,1), (0, v1), (a,1), (a, v1), (b,1), (b, v1) : a,b ∈ m1, ui ∈ R×1, and 1 ̸= v1 ∈ F1} ⊆ W(R). Then the subgraph induced by Ω1 contains K6,6 as a subgraph of Γ(R) and so g(Γ(R)) ≥ g(K6,6) ≥ 2, a contradiction. Hence

|m1| =1 and soR1∼=Z4or Z2x[x]2⟩. ByTheorem 1.4,F1̸=Z3and|F1| ≥4.

If|F1| ≥8, thenK3,7is a subgraph ofΓ(R)and byLemma 1.3,g(Γ(R))≥2, a contradiction. Hence|F1| ≤7 and soF1is isomorphic to one of the following fields:F4,F5orF7.

(5)

Fig. 2.4. A planar embedding ofΓ(Z4×F4)andΓ

Z2[x]

x2 ×F4

.

Fig. 2.5. A planar embedding ofΓ(Z4×F5)andΓ

Z2[x]

x2 ×F5

.

Suppose|m1| ≥ 2. Then by above argument, we have F1 = Z2. If|m1| ≥ 4, then|R1×| ≥ 5 and so K5,5 is a subgraph ofΓ(R). ByLemma 1.3,g(Γ(R))≥2, a contradiction. Hence|m1| =2 or 3 and soR1is isomorphic to one of the following rings:

Z9,Z3[x]

x2 ,Z8,Z2[x]

x3 , Z4[x]

2x,x2−2, Z4[x]

⟨2,x⟩2,Z2[x,y]

⟨x,y⟩2 ,F4[x]

x2 or Z4[x]

x2+x+1. IfR1∼=F4[x]

x2⟩ or ⟨x2Z+x4[x]+1⟩, then|R1×| =12 and soK4,12is a subgraph ofΓ(R). ByLemma 1.3,g(Γ(R))≥2, a contradiction. HenceR1 F4x[x]2⟩ and⟨x2Z+x+14[x] ⟩.

Converse follows fromFigs. 2.2–2.6.

3. Planarity ofΓr(R)

LetRbe a commutative ring with identity. Thereduced cozero-divisor graphof R, denoted byΓr(R), is a graph with vertex-setΩ(R), which is the set of all non-zero nontrivial principal ideals of R, and two distinct vertices Rx andR yinΩ(R)are adjacent if and only ifRx ̸⊆ R y andR y ̸⊆ Rx. In this section, we determine all isomorphism classes of finite commutative non-local rings with identity whoseΓr(R)is planar.

Theorem 3.1. Let R=F1× · · · ×Fnbe a finite commutative ring with identity, where each Fj is a field and n≥2.

ThenΓr(R)is planar if and only if R is isomorphic to one of the following rings: F1×F2×F3or F1×F2. Proof. SupposeR∼=F1×F2×F3,F1×F2. Then it is easy to see thatΓr(R)is planar (see,Fig. 3.1).

(6)

Fig. 2.6. A planar embedding ofΓ(Z4×F7)andΓ

Z2[x]

x2 ×F7

.

Fig. 3.1. Planar Embedding of Reduced Co-zero divisor graph.

AssumeΓr(R)is planar. Supposen ≥ 4. LetA = {x1,x2,x3,x4,x5,x6} ⊆ V(Γr(R)), wherex1 = F1×(0)× (0)×(0)× · · · ×(0),x2= F1×(0)×(0)×F4×(0)× · · · ×(0),x3 = F1×F2×(0)×(0)× · · · ×(0),x4 = 0×(0)×F3×F4×(0)× · · · ×(0),x5=(0)×F2×F3×F4×(0)× · · · ×(0),x6=(0)×F2×F3×(0)×(0)× · · · ×(0). Then the subgraph induced by A in Γr(R) contains K3,3 as a subgraph, a contradiction. Hence n ≤ 3 and so

R∼=F1×F2×F3or F1×F2.

Theorem 3.2. Let R = R1×R2× · · · ×Rn be a commutative ring with identity1, where each(Ri,mi)is a local ring withmi ̸= {0}and n ≥2. ThenΓr(R)is planar if and only if R∼= R1×R2such thatmi is the only non-zero principal ideal in Ri.

Proof. SupposeR = R1×R2such thatmi is the only non-zero principal ideal inRi fori =1,2. Then it is easy to see that the graphΓr(R)is planar (seeFig. 3.2).

Assume that Γr(R) is planar. Suppose n ≥ 3. Let A = {x1,x2,x3,x4,x5,x6} ⊆ V(Γr(R)), where x1 = (0)×R2×(0)× · · · ×(0), x2 = (0)× R2× I ×(0)× · · · ×(0), x3 = (0)×R2× R3×(0)× · · · ×(0), x4 = R1×(0)× · · · ×(0),x5 = R1×(0)×I ×(0)× · · · ×(0),x6 = R1×(0)×R3×(0)× · · · × · · · ×(0). Here I is non-zero principal ideal in R3. Then the subgraph induced by AinΓr(R)containsK3,3as a subgraph, a contradiction. Hencen=2.

(7)

SupposeRi contains at least two non-zero principal ideals for somei. Without loss of generality, we assume that i=2. LetI1= ⟨x⟩,I2= ⟨y⟩be two distinct principal ideals inR2.

Case 1.I1̸⊆I2andI2̸⊆I1. LetB= {x1,x2, . . . ,x6} ⊆V(Γr(R)), wherex1=(0)×I1,x2=R1×I1,x3=J1×R2, x4=(0)×I2,x5=R1×I2,x6=J1×I2andJ1is a principal ideal inR1. Then the subgraph induced byBinΓr(R) containsK3,3as a subgraph, a contradiction.

Case 2. I1 ⊂ I2or I2 ⊂ I1. Without loss of generality, we assume thatI1 ⊂ I2. LetC = {y1,y2, . . . ,y7,y8} ⊆ V(Γr(R)), where y1 = R1×(0),y2 = R1×I2, y3 = (0)× R2, y4 = J1×I2, y5 = (0)×I2, y6 = J1× R2, y7= J1×(0),y8= R1×I2andJ1is a principal ideal in R1. Then the subgraph induced byCinΓr(R)contains a subdivision ofK3,3, a contradiction. HenceRi contains only one principal ideal. We claim that this principal ideal is maximal. It is enough to prove thatm1is a principal ideal in R1.

Supposem1is not a principal ideal inR1. Then there exists two distinct elementsx,y∈m1such that⟨x⟩and⟨y⟩ are distinct ideals inR1. ThusR1contains two non-zero principal ideals and by Cases 1 and 2,Γr(R)containsK3,3

as a subgraph, a contradiction. Hencemi is principal for alli=1,2.

Converse follows fromFig. 3.2.

Theorem 3.3. Let R=R1×· · ·×Rn×F1×· · ·×Fmbe a finite commutative ring with identity, where each(Ri,mi)is a local ring and each Fj is a field, m,n≥1. ThenΓr(R)is planar if and only if R satisfies the following conditions:

(i)n+m=2

(ii)There exists only two non-zero principal ideals⟨a1⟩,⟨a2⟩in R1such that⟨a1⟩ ̸⊆ ⟨a2⟩and⟨a2⟩ ̸⊆ ⟨a1⟩. (iii)m1= ⟨a⟩is a principal ideal with nilpotency at most k=4and

if k=2, then⟨a⟩is the only ideal in R1 if k=3, then⟨a⟩,

a2

are the only ideals in R1 if k=3, then⟨a⟩,

a2 ,

a3

are the only ideals in R1.

Proof. SupposeRis isomorphic to R1×F1whereR1has at most three proper ideals. It is easy to see thatΓr(R)is planar (seeFigs. 3.3and3.4).

Conversely, assume thatΓr(R)is planar. Suppose n ≥ 2. Let A = {x1,x2,x3,y1,y2,y3} ⊆ V(Γr(R)) where x1 = ⟨x⟩ × ⟨y⟩ × · · · × Rn × F1 ×(0)× · · · ×(0), x2 = (0)× R2 × · · · × Rn × F1 ×(0)× · · · × (0), x3= ⟨0⟩ × ⟨y⟩ ×R3× · · · ×Rn×F1×(0)× · · · ×(0),y1=R1×(0)× · · · ×(0),y2=R1×R2×(0)× · · · ×(0), y3 = R1×(0)× · · · ×(0)×F1×(0)× · · · ×(0). Then the subgraph induced by A inΓr(R)containsK3,3as a subgraph, a contradiction. Hencen=1.

Supposem≥2. Thenn+m≥3. LetB= {z1,z2,z3,u1,u2,u3} ⊆V(Γr(R)), wherez1= ⟨x⟩ ×F1×F2×(0)×

· · · ×(0),z2=(0)×F1×F2×(0)× · · · ×(0),x3=(0)×(0)×F2×(0)× · · · ×(0),u1=R1×F1×(0)× · · · ×(0), u2=R1×F1×(0)× · · · ×(0),u3=R1×(0)× · · · ×(0). Then the subgraph induced byBinΓr(R)containsK3,3 as a subgraph, a contradiction. Hencem=1 and soR =R1×F1.

SinceRis finite,R1is an Artinian ring and so every ideal inR1is finitely generated. LetΩ = {a1, . . . ,at :ai ∈ R1,ai ̸=aj,fori ̸= j}be a minimal generating set form1inR1. Thent ≥1 and⟨ai⟩ ̸⊆

aj

for alli̸= j.

Supposet ≥ 3. Let B = {x1,x2,x3,x4,x5,x6} wherex1 = ⟨a1⟩ ×(0), x2 = ⟨a2⟩ ×(0), x3 = R1×(0), x4 = ⟨a3⟩ ×(0),x5 = ⟨a3⟩ ×F1,x6 = (0)×F1. Then the subgraph induced by B inΓR(R)contains K3,3as a subgraph, a contradiction. Hencet≤2.

(8)

Fig. 3.4. Γr(R1×F1)andt=1.

Assume thatt =2. Suppose⟨b1⟩is a non-zero ideal inR1such that⟨b1⟩ ⊂ ⟨a1⟩. Then the subgraph induced by {⟨a1⟩ ×(0),⟨b1⟩ ×(0),R1×(0),⟨a2⟩ ×(0),⟨a2⟩ ×F1, (0)×F1}inΓr(R)containsK3,3as a subgraph, a contradiction.

Hence⟨a1⟩,⟨a2⟩are the only non-zero principal ideals inR1.

Assume that t = 1. Thenm1 is a principal ideal generated by a1. Since R1 is Artinian, m1 is nil-ideal with nilpotencykand somk1=(0),mk−11 ̸=(0). From this, we get(0)⊂

 a1k−1

 a1k−2

⊂ · · · ⊂ ⟨a1⟩are the only ideals in R1. Supposek ≥ 5. Then the subgraph induced by{⟨a1⟩ ×(0),⟨0⟩ ×F1,R1×(0),

a21

×F1, a31

×F1, a14

× F1,

a12×(0),

a13×(0)}inΓr(R)contains a subdivision ofK3,3, a contradiction. Hencek≤4 and so R1contains at most three non-zero principal ideals.

References

[1] I. Beck, Coloring of commutative rings, J. Algebra 116 (1988) 208–226.

[2] D.F. Anderson, P.S. Livingston, The zero-divisor graph of a commutative ring, J. Algebra 217 (1999) 434–447.

[3] M. Afkhami, K. Khashyarmanesh, The cozero-divisor graph of a commutative ring, Southeast Asian Bull. Math. 35 (2011) 753–762.

[4] M. Afkhami, K. Khashyarmanesh, On the cozero-divisor graphs of commutative rings and their complements, Bull. Malays. Math. Sci. Soc.

35 (4) (2012) 935–944.

[5] M. Afkhami, K. Khashyarmanesh, Planar, outerplanar, and ring graph of the cozero-divisor graph of a finite commutative ring, J. Algebra Appl. 11 (2012) 1250103. 9 pages,http://dx.doi.org/10.1142/S0219498812501034.

[6] Amanda Wilkens, J. Cain, L. Mathrwson, Reduced cozero-divisor graphs of commutative rings, Int. J. Algebra 5 (19) (2011) 935–950.

[7] M.F. Atiyah, I.G. Macdonald, Introduction to Commutative Algebra, Addison-Wesley Publishing Company, 1969.

[8] A.T. White, Graphs, Groups and Surfaces, North-Holland, Amsterdam, 1973.

[9] G. Chartrand, L. Lesniak, Graphs and Digraphs, Wadsworth and Brooks/Cole, Monterey, CA, 1986.

[10] D.F. Anderson, A. Frazier, A. Lauve, P.S. Livingston, The zero-divisor graph of a commutative ring II, Lect. Notes Pure Appl. Math. 220 (2001) 61–72.

[11] S.P. Redmond, On zero-divisor graphs of small finite commutative rings, Discrete Math. 307 (2007) 1155–1166.

Referensi

Dokumen terkait

A graph is said to be semisymmetric if its full automorphism group acts transitively on its edge set but not on its vertex set.. In this paper, we prove that there is only

Dominating set and dominating number, graph coloring, graph labeling, and metric dimension are a few of the issues that have grown in popularity in the field of graph theory.. As

Furthermore, labeling known as a vertex irregular total k-labeling and total vertex irregularity strength of graph is the minimumk for which the graph has a vertex irregular

The m-step bipolar neutrosophic competition graph of bipolar neutrosophic digraph−→ G is denoted by Cm−→ G = A, B which has same bipolar neutrosophic set of ver- tices as in −→ G and

The minimum value 𝑘 for which a graph 𝐺 has totally irregular total labeling, is called the total irregularity strength of 𝐺, denoted by 𝑡𝑠𝐺.. They [4] have proved that for every graph

Size of a set Definition If there are exactlyn distinct elements in a set S, wheren is a non-negative integer, then we say S is finite and cardinality ofS is n.. A set that is not

Proposition The graph G has exactly150 connected components, and each connected component is isomorphic to the triangular graph T7, which is srg21,10,5,4... LetD denote the set of

We define a new class of hesitancy fuzzy graph, the intuitionistic hesitancy fuzzy graph in which the degree of hesitancy of a vertex is independent of the degree of its membership and