‫زانكۆی سەالحەدین – هەولێر‬

Salahaddin University - Erbil

The Sombor index of order divisor graph of

some finit groups
Research Project
Submitted To The Department Of (Mathmatics) In Partial Fulfillment Of The
Requirements For The Degree Of B.A Or BSc. In (Mathmatics)

By:
Rayan Faysal Hamad

Supervised by:
Dr. Sanhan Khasraw

April - 2023
Certification Of The Supervisor

I Certify That This Work Was Prepared Under My Supervision At The

Department Of Mathematics / College Of Education / Salahaddin
University-Erbil In Partial Fulfillment Of The Requirements For The
Degree Of Bachelor Of Philosophy Of Science In Mathematics.

Signature:
Supervisor: Dr. Sanhan Khasraw
Scientific Grade: Assist. Professor
Date: / / 2023

In View Of The Available Recommendations, I Forward This Work For

Debate By The Examining Committee,

Signature:
Name: Dr. Rashad Rashid Haji
Scientific Grade: Assist. Professor
Chairman Of The Mathematics Department
Date: / / 2023
 Acknowledgements

I Would Like To Thank God, For Letting Me Through All The Difficulties. I Have
Experienced Your Guidance Day By Day. You Are The One Who Let Me Finish My
Degree. I Will Keep On Trusting You For: My Future.
I Would Also Like To Give Special Thanks To My Family As A Whole For Their
Continuous Support And Understanding When Undertaking My Research And
Writing My Project. Your Prayer For Me Was What Sustained Me This Far.
I Would Like To Acknowledge And Give My Warmest Thanks To My Supervisor (Dr.
Sanhan Khasraw) Who Made This Work Possible. His/Her Guidance And Advice
Carried Me Through All The Stages Of Writing My Project. I Would Also Like To
Thank My Committee Members For Letting My Defense Be An Enjoyable Moment,
And For Your Brilliant Comments And Suggestions, Thanks To You.

I
 Table Of Content
Acknowledgment……………………………………………………………………………………………… I
Content…………………………………………………………………………………………………………….II
Abstract…………………………………………………………………………………………………………..III
Introduction……………………………………………………………………………………………………..1
Chapter One…………………………………………………………………………………………..…………2
Background………………………………………………………………………………………………………2
Chapter Two……………………………………………………………………………………………………..4
The Sombor Index Of The Order Divisor ℤn……………………………………………………….4
Chapter Three…………………………………………………………………………………………………11
The Sombor Index Of The Order Divisor Graph Dℤn………………………………………..11
References……………………………………………………………………………………………………..15
‫……………………………………………………………………………………………………………خالصة‬..16
‫………………………………………………………………………………………………… پوختە‬.…………..16

II
 Abstract
Let G Be A Finite Group. Then OD(G) Denotes The Order Divisor Graph Whose
Vertex Set Is G Such That Two Distinct Vertices A And B Having Different Orders Are
Adjacent Provided That O(A) L O(B) Or O(B)| 0(A). In This Work, We Calculated The
Sombor Index For Order Divisor Graph Of Some Finite Groups Such As ℤn , D2n.

III
 Introduction
The Idea Of A Divisor Graph Of A Finite Set Of Positive Integers. According To These
Authors, A Divisor Graph X Is An Ordered Pair (V,E) Where V Is A Subset Of Positive
Integers N And Ab ∈ E If And Only If Either A Divides B Or B Divides A For All A ≠ B.
They Were Studied Basic Properties Of Divisor Graphs.
Denoted By P(G) Having All The Proper Subgroups Of G As Its Vertices And Two
Distinct Vertices H And K Are Adjacent In P(G) If And Only If H And K Are Relatively
Prime. These Authors Proved That P(G) Is Weakly X-Perfect And Every Simple Graph
Is An Induced Subgraph Of P(ℤ), For Some N.
The Sombor Index (So) Has A Lot Of Attention Within Mathematic And Chemistry,
Then The Sombor Index Of 𝛤 Is Defined As So(𝛤)=𝛴𝑢𝑣𝜖(𝛤) √𝑑(𝑢)2 + 𝑑(𝑣)2 Lately
Introduced By Ivan Gutman. This Project Consists Of Three Chapter, We Give Some
Necessary Back Grounds About Groups And Graphs. In Chapter Two Calculate The
Sombor Index Of Order Divisir Graph To ℤn In Chapter Three Calculate The Sombor
Index Of Order Divisor Graph To D2n.

1
 Chaper One
Background
Definition 1.1: (patrick, 2014)
A Group (G,*) Is A Set G, Together With A Binary Operation* On G, Such That The
Following Axioms Are Satisfied:
I - The Binary Operation * Is Associative
. II - There Is An Element 1 In G Such That For All 𝑥 ∈ 𝐺, (The Element 1 Is An Identity
Element For * On G).
III - For Each a In G, There Is An Element a' In G With The Property That
a*a' = a*a' =1 (The Element a' Is An Inverse Of A With Respect To *).

Definition 1.2 (s.u.rehman, 2017): Let G Be A Finite Group. Then OD(G) Denotes
The Order Divisor Graph Whose Vertex Set Is G Such That Two Distinct Vertices A
And B Having Different Orders Are Adjacent Provided That O(A) | O(B) Or O(B) |
O(A).

Definition 1.3 (olson, 2017): Let N Be A Positive Integer The Collection ℤn Is Defined
As ℤn={[5],[1],[2],…,[N-1]}.

Definition 1.4 (burton d. m., 1980): Euler Phi Function Φ For N≥1, Let Φ (N) Denote
The Number Of Positive Integers Not Exceeding M That Are Relatively Prometon
Definition 1.5 (patrick, 2014): Graph G Is A Finite Non Empty Set V Of Objects Called
Vertices (The Singular Is Vertex) Together With A Possibly Empty Set E Of 2-
Element Subsets Of V Called Edges.
Definition 1.6 (patrick, 2014): Degree Of A Vertex V In A Graph R Is The Number Of
Vertices In R That Are Adjacent To V.
Definition 1.7 (khasraw, 2020): The Dihedral Group Of Order D₂N Of Order 2n Is
Defined By D2n = {R, S |𝑟 𝑛 =S2=1, Srs-1=R-1}

2
Definition 1.8 (gutman, 2020): Let 𝛤 Be A Graph. Then The Sombor Index Of 𝛤,
Denoted By SO(𝛤), Is Defined By SO(𝛤) = 𝛴𝑢,𝑣𝜖𝐸(𝛤) √𝑑𝛤 (𝑢)2 + 𝑑𝛤 (𝑣)2 , Where 𝑑𝛤
(U) Is The Degree Of Vertex U And 𝑑𝛤 (V) Is The Degree Of Vertex V In 𝛤.
Definition 1.9 (burton d. m., 1980): Let A And B Be Given Integers, With At Least
One Of Them Different From Zero. The Greatest Common Divisor Of A And B,
Denoted By Gcd (A, B),Is The Positive Integer D Satisfying The Following.
Definition 1.10 (burton d. m., 1980) : Two Integers A And B, Not Both Of Which Are
Zero, Are Said To Be Relatively Relatively Prime Whenever Gcd (A,B) = 1.

3
 Chapter Two
In This Chapter We Compute The Sombor Index Of An Order Divisor Graph Of The
Group ℤn
Theorem 2.1 : Let 𝛤 = 𝛤 ℤ𝑛 Be An Order Divisor Graph Of ℤn If N=P, Then
𝛤 = 𝑘1 , 𝜙(𝑝)
Proof : The Only Element In ℤ𝑝 Of Order 1 Is The Identify Element, O, Then The
Vertex O In 𝛤 Is Adjacent To All Other Vertices In 𝛤. Since 𝜙(𝑝)=P-1, Then There
Are P-1 Elements In ℤ𝑝 Of Order P. So That None Of Them Is Adjacent O Any Other
Therefore, 𝛤 = 𝑘1 , 𝜙(𝑝)

Theorem 2.2 : Let 𝛤 = 𝛤 ℤ𝑛be Order Divisor Graph Of ℤn, If M=P Then So (𝛤) =
(𝑃 − 1)√𝑝2 − 2𝑃 + 2
Proof : By Theorem 1, There Are P-1 Edges In 𝛤 Each With One End-Vertex Of
Degree 1 And The Other End-Vertex Of Degree P-1 Thus, So
(𝛤) = (𝑃 − 1)√12 − (𝑝 − 1)2

(𝑝 − 1)√1 + 𝑃2 − 2𝑝 + 1 = (𝑝 − 1)√𝑝2 − 2𝑝 + 2
Example 2.3: If N=5, Then 𝛤𝑧5 Is As Follows :
1 2 3 4

Theorem 2.4 : Let 𝛤 = 𝛤 ℤ𝑛 Be An Order Divisor Graph Of ℤn, If N=Pk, Then 𝛤 =

𝑘1, 𝜙(𝑃), 𝜙(𝑝2 ), ⋯ , 𝜙(𝑝𝑘 )
Proof : The Only Element In ℤ𝑝 Of Order 1 Is The Identify Element, O. Then The
Vertices In 𝛤. There Are 𝜙(𝑝𝑖 ) Elements In ℤ𝑝 k Of Order Pi, For I=1,…,K, And None
Of Then In 𝛤 Is Adjacent To Any Others. Therefore 𝛤 = 𝑘1 , 𝜙𝐿𝑝 , 𝜙(𝑝2 ), … 𝜙, (𝑝𝑘 )

4
Theorem 2.5 : Let 𝛤 = 𝛤 ℤ𝑛 Be An Order Divisor Graph Of ℤn If N=Pk, Then For V
𝛤

𝑝𝑘−1 ⅈ𝑓 𝑣 = 0
Deg(𝑣) = {
𝑝𝑘 − ∅(𝑝𝑖 )
I=1, … , K,
M=1,…,Pi-1 And M Is Not A Multiple Of P.

Theorem 2.6: Let 𝛤 = 𝛤 ℤ𝑛 Be An Order Divisor Graph Of ℤn If N=Pk, Then

𝑝 𝑧𝑘 − 1
|𝐸(𝛤)| =
1+𝑝

𝑘 𝑘
Proof: 𝑝𝑘 − 1 ∑𝑖−1 𝑝𝑘 𝜙(𝑝𝑖 ) − ∑𝑖−1 𝑝𝑖 𝜙(𝑝𝑖 )
𝑘 𝑘

= 𝑝𝑘 − 1 + 𝑝𝑘 ∑ 𝜙(𝑝𝑖 ) − ∑ 𝜙(𝑝2𝑖 )
𝑖−1 𝑖−1

= 𝑝𝑘 − 1 + 𝑝𝑘 (𝜙(𝑝) + 𝜙(𝑝2 ) + 𝜙(𝑝3 ) + ⋯ + 𝜙(𝑝𝑘−1 ) + 𝜙(𝑝𝑘 ))

− (𝜙(𝑝2 ) + 𝜙(𝑝4 ) + 𝜙(𝑝6 ) + ⋯ + 𝜙(𝑝2𝑘−2 ) + 𝜙(𝑝2𝑘 ))

= (𝑝𝑘 − 1) + 𝑝𝑘 ((𝑝 − 1) + (𝑝2 − 𝑝) + (𝑝3 − 𝑝2 ) + ⋯

+ (𝑝𝑘−1 − 𝑝𝑘−2 + (𝑝𝑘 − 𝑝𝑘−1 ))
− ((𝑝2 − 𝑝) + (𝑝4 − 𝑝3 ) + (𝑝6 − 𝑝5 ) + ⋯
+ (𝑝2𝑘−2 − 𝑝2𝑘−3 ) + (𝑝2𝑘 − 𝑝2𝑘−1 ))

−(𝑝𝑘 − 1) + 𝑝𝑘 (𝑝𝑘 − 1) − ((𝑝2 + 𝑝3 + 𝑝6 + ⋯ + 𝑝2𝑘−2 + 𝑝2𝑘 ) − (𝑝 + 𝑝3 + 𝑝5

+ ⋯ + 𝑝2𝑘−3 + 𝑝2𝑘−1
= ( 𝑝𝑘 − 1) + 𝑝𝑘 (𝑝𝑘 − 1) − ((𝑝2 + 𝑝4 + 𝑝6 + ⋯ + (𝑝2𝑘−2 − 𝑝2𝑘−3 ) + (𝑝2𝑘
− 𝑝2𝑘−1

5
 = ( 𝑝𝑘 − 1) + 𝑝𝑘 (𝑝𝑘 − 1) − ((−𝑝 + 𝑝2 + 𝑝3 + 𝑝4 + 𝑝5 + 𝑝6 + ⋯ + 𝑝2𝑘−3
+ 𝑝2𝑘−2 − 𝑝2𝑘−1 + 𝑝2𝑘−1 + 𝑝2𝑘
= ( 𝑝𝑘 − 1) + 𝑝𝑘 (𝑝𝑘 − 1) − (𝑝 + 𝑝2 − 𝑝3 + 𝑝4 − 𝑝5 + 𝑝6 + ⋯ 𝑝2𝑘−3 + 𝑝2𝑘−2
− 𝑝2𝑘−1 + 𝑝2𝑘
= 𝑝𝑘 − 1 + 𝑝2𝑘−2 − 𝑝2𝑘−1 + 𝑝2𝑘 )

𝑘 2𝑘
𝑝2𝑘+1 𝑝
𝑘 2𝑘
𝑝2𝑘+1 𝑝
=𝑝 −1+𝑝 −𝑝 −( ) = (𝑝 − 1) −
1+𝑝 1+𝑝
𝑘+1
2𝑘
(𝑝2 − 𝑝) (1 + 𝑝)(𝑝2𝑘 − 1) − 𝑝2𝑘+1 + 𝑝
= (𝑝 − 1) − =
1+𝑝 1+𝑝
2𝑘 2𝑘+1 2𝑘+1 2𝑘
𝑝 −1+𝑝 −𝑝−𝑝 +𝑝 𝑝 −1
= =
1+𝑝 1+𝑝

Theorem 2.7: Let 𝛤 = 𝛤 ℤ𝑛 Be An Order Divisor Graph Of ℤn, If N=Pk Then

So (𝛤)=

Proof:

6
Example2.8 : If Let N=23 Then 𝛤𝑧8 Is As Follows =

1
2

5
6
7

Theorem 2.9 : Let 𝛤 = 𝛤 ℤ𝑛 Ne Order Divisor Graph Of ℤn. If N=Pq P&Q Are Primes
And P<Q.
Then 𝛤 Is As In The Following Figure

Sq Spq Sp

So

Where Sq={Q, ℤq,…,(P-1)Q}, Sp={P,2p,…,(Q-)}, So={0}, Spq={X∈ ℤpq/G Cd (X,Pq)=1}

7
Proof: There Are 𝜙 (P)=P-1 Elements Of Order P, 𝜙 (Q)=Q-1 Elements Of Order Q,
One Element Of Order 1, Amd 𝜙(Pq)=(P-1)(Q-1) Elements Of Order Pq.

Theorem 2.10 : Let 𝛤 = 𝛤 ℤ𝑛 Be An Order Divisor Graph Of ℤn If N=Pq, P And Q

Are Detente Primes, Them
𝑝𝑞− 1 ⅈ𝑓 𝑣 = 0
𝜙(𝑝𝑞) + 1 ⅈ𝑓 𝑣 = {𝑚𝑝, 𝑚 = 1,2, … , 𝑞 − 1}
Deg(𝑣) =
𝜙(𝑝𝑞) + 1 ⅈ𝑓 𝑣 = {𝑘𝑞, 𝑘 = 1,2, … , 𝑝 − 1}
{ 𝑝𝑞 − 𝜙(𝑝𝑞)
Otherwise
Proof: Since O(0)=1 And It Divides The Order Of All Other Elements, Then
Deg(0)=Pq-1. The Order Of Mp, M=1,…,Q-1, I Relatively Prime To The Order Of Kq,
K=1,…, P-1, Then There Is No Edge Between Mp An Kq, Thi, Deg(V)= 𝜙 (Pq)+1 If
V=Mp Or V=Kq, M=1,…,Q-1, K=1,… . Otherwise, Deg (V)=Pq- 𝜙 (Pq)=P+Q-1.

Theorem 2.11 : Let 𝛤 = 𝛤 ℤ𝑛 Be An Order Divisor Graph Of ℤn If N=Pq, P And Q

Are Distinct Primes, Then |𝐸(𝛤)| = 𝑃2 𝑞 + 𝑝𝑞 2 − 3𝑝𝑞 − 𝑝2 − 𝑞 2 + 3𝑝 + 3𝑞 − 3

Proof: There Is One Vertex Of Degree Pq-1, There Are (P-1)+(Q-1) Vertices
𝜙(𝑝𝑞) + 1 And 𝜙(𝑝𝑞) Vertices Of Degree Pq- 𝜙(𝑝𝑞). 𝑡ℎ𝑢𝑠,

∑ 𝑑ⅇ𝑦(𝑣) = 𝑝𝑞 − 1 + (𝑝 + 𝑞 − 2)( 𝜙(𝑝𝑞) + 1) + 𝜙(𝑝𝑞)(𝑝𝑞 − 𝜙(𝑝𝑞)

𝑣𝜖𝛤

Since 𝜙(𝑝𝑞) = (𝑝 − 1)(𝑞 − 1) = 𝑝𝑞 − 𝑝 − 𝑞 + 1, Then

∑𝑣𝜖𝛤 𝑑ⅇ𝑦(𝑣) = 𝑝𝑞 − 1 + (+1 − 2)(Pq − P − Q + 2) + (Pq − P − Q + 1)(P +
Q − 1)
= 2𝑝2 + 2𝑝𝑞 2 − 6𝑝𝑞 − 2𝑝2 − 2𝑞 2 + 6𝑝 + 6𝑞 − 6.

8
Therefore
∑𝑣∈𝛤 𝑑ⅇ𝑦(𝑣)
|𝐸(𝛤)| =
2
=P2q+Pq2-3pq-P2+3p+3q-3

Theorem 2.12 : Let 𝛤 = 𝛤 ℤ𝑛 Be An Order Divisor Graph Of ℤn If N=Pq, P And Q

Are Distinct Prime Then So ( 𝛤) = (𝑝 + 1 −
2)(√(𝑝𝑞 − 1)2 + (𝑝𝑞 − 𝑝 − 𝑞 + 2)2 + (𝑝𝑞 − 𝑝 − 𝑞 +
1)√(𝑝𝑞 − 𝑝 − 𝑞 + 2)2 + (𝑝 + 𝑞1)2 ) + (𝑝𝑞 − 𝑝 − 𝑞 +
1)√(𝑝𝑞 − 1)2 + (𝑝 + 𝑞 − 1)2

Proof: There Are P-1 Edges With One End-Vertex Of Degree Pq-1 And The Other Of
Degree Φ(Pq) + 1 There Are Q-1 Edges With One End-Vertex Of Degree Pq-1 And
He Other Of Degree Φ(Pq) + 1, There Are Φ(Pq) Edges With One End-Vertex Of
Degree Pq-1 And The Other Of Degree Pq − Φ(Pq) = P + Q − 1, There Are (P-1)
Φ(Pq) Edges With One End-Vertex Of Degree Φ(Pq)+1, And The Other Of Degree
P+Q-1, And There Are (Q-1) Φ (Pq) Edges With One End-Vertex Of Degree Φ(Pq)+1
And The Other Of Degree P+Q-1, Thus

So ( 𝛤 )= (𝑝 − 1)√(𝑝𝑞 − 1)2 + (𝑝𝑞 − 𝑝 − 𝑞 + 2)2 + (𝑞 −

1)√(𝑝𝑞 − 1)2 + (𝑝𝑞 − 𝑝 − 𝑞 + 2)2 + (𝑝𝑞 − 𝑝 − 𝑞 + 1)√(𝑝𝑞 − 1)2 + (𝑝 + 𝑞 − 1)2 +
(𝑝 − 1)(𝑝𝑞 − 𝑝 − 𝑞 + 1) × √(𝑝𝑞 − 𝑝 − 𝑞 + 2)2 + (𝑝 + 𝑞 − 1)2 + (𝑞 − 1)(𝑝𝑞 − 𝑝 −
𝑞 + 1) × √(𝑝𝑞 − 𝑝 − 𝑞 + 2)2 + (𝑝 + 𝑞 − 1)2 = (𝑝 + 𝑞 −
2)√(𝑝𝑞 − 1)2 + (𝑝𝑞 − 𝑝 − 𝑞 + 2)2 + (𝑝𝑞 − 𝑝 − 𝑞 − 1)√(𝑝𝑞 − 1)2 + (𝑝 + 𝑞 − 1)2 +
(𝑝 + 𝑞 − 2)(𝑝𝑞 − 𝑝 − 𝑞 + 1√(𝑝𝑞 − 𝑝 − 𝑞 + 2)2 + (𝑝 + 𝑞 − 2)2

9
Example 2.13 : If Let M=3:5, How 𝛤ℤ15 Is As Follows

S5 S15 S3

So

Where S5= {5,10}, S3 ={3,6,9,12}, So={0}, S15={1,2,4,7,8,11,13,14}.

10
 Chapter Three
In This Chapter We Compute Sombor Index Of An Order Divisor Graph Of The
Group Recall That D2n={R,S | Rn=Sz=1,Srs-1=R1}

Theorem 3.1: Let 𝛤 = 𝛤D2n To Be Order Divisor Graph Of D2n. If Not, A Prime, Ther
D2n If N=P, A Prime, Then 𝛤 D2n Is An Bipartite Graph K₁, 2n-1.

Proof: It Is Clear That O(Sri)=2 For I=1,2,…,-N And O(Rj)=P For I=1,..., N-1. Then
There Is No Edge Between Sri And Rj For, I=1,…,N And J=1,…,N-1 Thus. 1 Is Adjacent
To All Other Vertices In 𝛤. Therefore, 𝛤 =K₁, N-1
Theorem 3.2: Let 𝛤 = 𝛤 D2n Be Order Divisor Graph Of D2n, If N=P, A Prime
Then |𝐸(𝛤)|=2n-1
Proof: It Is A Straight Forward By Theorem 3.1

Theorem 3.3: Let 𝛤 = 𝛤 D2n Be Order Divisor Graph Of D2n If N=P, A Prime

Then So(𝛤)=(2n-1) √4𝑛2 − 4𝑛 + 2

Proof: By Theorem 3.2, There Are 2n-1 Edges With One End-Vertex Of Degree
One And The Other End-Vertex Of Degree 2n-1 This

So(𝛤)=(2n-1)√(2𝑛 − 1)2 + 12 = (2𝑛 − 1)√4𝑛2 − 4𝑛 + 1 + 1 = (2𝑛 −

1)√4𝑛2 − 4𝑛 + 2
Example 3.4: P=3

S Sr Sr2

I r r2
11
Theoreme 3.5: Let 𝛤 = 𝛤 𝐷2𝑛 Be An Order Diviser Graph Of D2n If N=P2, P Is Figure
1 An Odd Prime, Then 𝛤 Is As In Figure 1

S2

S1

Sp Sp2

Where S1 {1}, S2 {Sri | I=1,…,N},

Sp = {Rkp | K=1,…,P-1} And
Sp2 {Ri | Gcd (I,P2)=1}
Proof :- Since O(Sri)=2, 1,…,N, And O(1)=1, Then 1 Is Adjacent To Sri And
All Other Vertices In 𝛤 . Since The Order Of Rkp, K=1,…,P-1 Is P And The
Order Of Ri, Gcd (J,P2)=1, Is P², Then Each Vertex In Sp Is Adjacent To
Every Vertex In Sp2. The The Result Follows.

12
Theoreme 3.6: Let 𝛤 = 𝛤 D2n Be An Order Divisor Graph Of D2n. N=P2, P Is An
Odd Prime, Then

Proof: The Proof Is A Straightforward From Theorem 3.5.

Theoreme 3.7: Let 𝛤 = 𝛤 D2n Be An Order Divisor Graph Of D2n. If N = P2 , P Is

An Odd Prime, Then
|𝐸(𝛤)| = 𝑝3 + 𝑝 − 1
1
Proof:- It Is Clear That |𝐸(𝛤)| = ∑𝑣∈𝛤 𝑑ⅇ𝑔(𝑣) By Theorem 3.6
2

|𝐸(𝛤)|

13
Theoreme 3.8: Let 𝛤 = 𝛤 D2n Be An Order Divisor Graph Of D2n. If N= P², P Is An
Odd Prime, Then
So(𝛤)=

Proof: By Theorem 3.7, There Are N Edges With One End Vertex Of Degree 2n-1
And The Other End-Vertex Of Degree 1, There Are 𝜙(P) Edges With One End-
Vertex Of Degree 2n-1 And The Other End-Vertex Of Degree 𝜙 (P²)+1, There Are 𝜙
(P²) Edges With One End-Vertex Of Degree 2n-1 And The Other End-Vertex Of
Degree 𝜙 (P)+1, And There Are 𝜙 (P)- 𝜙 (P²) = 𝜙 ( P³) Edges With One End-Vertex
Of Degree 𝜙 (P) +1 And The Other End-Vertex Of Degree 𝜙 (P2) H Thus,
SO(𝛤)=

14
References
1-applied mathematics and computation. (2021). In j. r. Roberto cruz, applied
mathematics and computation (p. 15).
burton, d. m. (1980). elementary number theory.
burton, d. m. (1980). elementary number theory. In elementary number theory (p.
389).
dummit, d. &. (2003). In abstract algebra 3rd ed. nj: wily.
G, C. &. (n.d.). In Fisrt Cours in Graph Theory. Illustrated Edition ed. (p. 2012. ).
NewYork: Dover Publisher.
Gary, C. L. (2015). In Graphs & Digraphs, 6th ed. Boca Raton. Fla.Chapman and
Hall/CRC.
Gutman, I. (n.d.). In Geometric Approach to Degree-Based Topological Indices:
Sombor (p. 2021).
gutman, i. (2020). geometric approach to degree -based topological
indices:sombor indices, 11-16.
khasraw. (2020). first course in abstract algebra. kingstone, rhode island.
olson, t. (2017). In t. olson, Applied fourier analysis (p. 302).
pasebani, s. p. (2014). the order graphsof groups , 1-10.
patrick, d. r. (2014). In abstract algebra (p. 187).
s.u.rehman, a. ,. (2017). order divisor graph of finite group, 29-40.
T. Tamizh Chelvama, K. S. (2011). Commuting Graphs on Dihedral Group. Tje
Journal of Mathematics and Computer Science Volume 2,, pp. 402-405.

15
 ‫خالصة‬
‫دع ‪ G‬تكون مجموعة محدودة‪ .‬ثم يشي)‪ OD (G‬إىل الرسم البيان للمقسوم عىل ر‬
‫اليتيب الذي‬ ‫ي‬
‫ه ‪ G‬بحيث يكون هناك رأسان متميان ‪ A‬و ‪ B‬لهما ترتيب مختلف متجاورين‬
‫تكون مجموعة رأسه ي‬
‫مؤش ‪ Sombor‬للرسم‬‫بشط أن (‪ O(B)| O )A‬أو (‪ O(B) | O )A‬ف ف هذا العمل ‪ ،‬قمنا بحساب ر‬ ‫ر‬
‫ي ي‬
‫اليتيب لبعض المجموعات المحدودة مثل ‪ ℤn‬و ‪D2n‬‬ ‫البيان للمقسوم عىل ر‬
‫ي‬

‫پوختە‬
‫با ‪ G‬گروپێیك سنوردار بێت‪ ،‬پاشان ‪ (G)OD‬گرافێیك دابەشكەری ڕیزبەندی دیاری دەكات كە‬
‫كۆمەڵەی لوتكەكان ‪G‬یە بە جۆرێك كە دوو لوتكەی جیاوازیان هەیە تەنیشت یە ر‬
‫كي بن بە مەرجێك‬
‫)‪ (A) O | O(B‬یان )‪ (A) O | O(B‬ئەم كارە‪ ،‬ئێمە ئیندێكسێیك ‪ Sombor‬بۆ گراف دابەشكەری‬
‫ڕێزبەندی هەندێك گروون سنوردار وەك ‪D2n ℤn‬‬

‫‪16‬‬