The Mean Antiprism Special Graph

𝑨𝑵𝒏
Research Project

Submitted to the Department of Mathematics in partial fulfillment of

the requirements for the degree of BSc. in MATHEMATIC

By:
Solin Dyar

Supervised by:

Assist. Prof. Dr. Rashad Rashid Haji

April– 2024

ii
 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. Rashad Rashid Haji

Scientific grade: Assistant Professor

Date: 4/4/2024

In view of available recommendations, I forward this word for debate by the

examining committee.

Signature:

Name: Dr. Rashad Rashid Haji

Scientific grade: Assistant Professor

Chairman of the Mathematics Department

Date: 4/4/2024

II
 Acknowledgment

First of all, I would like to thanks God for helping me to complete this
project with success.

Secondly, I would like to express my special thanks to my supervisor Assist.

Prof. Dr. Rashad Rashid Haji, it has been great honor to be his student.

It is great pleasure for me to undertake this project I have taken efforts

however it would not have been possible without the support and help of many
individuals.

Also I would like to express my gratitude towards my parents and special

friend Zahra Zrar.

My thanks appreciations go to Mathematical Department and all my valuable

teachers.

III
 Abstract

In this project we work on a special graph named antiprism graph ANn in

𝑛(𝑛+1)
which we find the Mean distance (ANn )= for 𝑛 ≥ 3 with giving some
2(2𝑛−1)

interesting examples about the subject. Moreover< we study some graphical properties of the
graph ANn such as Regularity, Girth, Planarity, Eulerian, Hamiltonian coloring and chromatic
number, Maximum and minimum degree of Vertices, radius and Diameter of the antiprism
special graph ANn.

IV
V
 Table of Contents

Certification of the Supervisor ........................................................................... II

Acknowledgment ............................................................................................. III
Abstract ............................................................................................................ IV
Table of Contents ............................................................................................. VI
List of Figures .................................................................................................. VI
CHAPTER ONE................................................................................................. 1
INTRODUCTION .............................................................................................. 1
Literature Review ............................................................................................... 2
CHAPTER THREE ............................................................................................ 6
THE MEAN DISTANCE, OF THE ANTIPRISM SPECIAL GRAPH 𝐴𝑁𝑛
WITH SOME GRAPHICAL PROPERTIES ...................................................... 6
3.1 The Mean distance of the Antiprism special graph 𝐴𝑁𝑛 .............................. 6
3.2 Some Graphical properties of the antiprism special graph 𝐴𝑁𝑛 .................. 10
Reference: ........................................................................................................ 11
‫ ثوختة‬..................................................................................................................... a

‫ اخلالصة‬.................................................................................................................... b

List of Figures
Figure 2.1 the antiprism special graph ANn ………………………………….….…5

Figure 3.1 the Antiprism special graph 𝐴𝑁9 …………………………………….…8

Figure 3.2 the antiprism special graph 𝐴𝑁8 ………………………………….….…9

VI
 CHAPTER ONE
INTRODUCTION

Graph Theory was first introduce in the century by swiss Mathematician Leon
hard Euler. His work on the famous “seven Bridges of Konigsberg problem, is
considered the origin of graph theory.
Kenneth,H,2014. Discrere mathematics and it’s Applications. 2 nd ed. New York:
A chapman & Hall dook.
The use of graphs in daily life also help in making an analysis. For example, in
provided structure in assessing performances, sales, and even deadlines. Seeing
things visually helps you make quicker decision. Graph also help make
calculation easier.
A graph in this context refers to a collection of Vertices or nodes and a collection
of edges that connect pairs of vertices[1]. Graph theory can be used in research
areas of computer science such as data mining image segmentation, clustering,
image capturing, networking.
The importance of graph theory for chemistry stems mainly from the existence of
the phenomenon of isomers which is rationalized by chemical structure theory.
In the field of microbiology, graph cam express the molecular structural, where
cell, gene or protein can be denoted as a vertex and the connect element can be
regarded as an edge. In this way, the biological activity characteristic can be
measured via to apological index computing in the corresponding graph.
The mean distance of a ( connected) graphs is the mean of the elements of it’s
graph distance Matrix. Closed forms for some classes of named graphs are given
in the following table. Class, mean distance.

1
 CHAPTER TWO
Literature Review

Definition 2.1: (Behzad & CHartrand, 1979) A graphs 𝐺 is a finite non empty set
of objects called vertices (the singular word is vertex) together with a (possibly
empty) set of unordered pairs of distinct vertices of 𝐺 called edges.

Definition 2.2: (Jonathan & Jay,2019) Let 𝐺 be a finite graph. Then the order of
𝐺 is denoted by |𝑉(𝐺)| and defined to be the number of vertices of 𝐺. And the
size of 𝐺 is denoted by |𝐸 (𝐺)| and defined to be the number of edges of 𝐺.

Definition 2.3: (Behzad & CHartrand, 1979) In a graph 𝐺 two vertices that are
joined by an edge are called adjacent vertices.

Definition 2.4: (Jonathan & Jay ,2019) Let 𝐺 be a graph and 𝑣 be a vertex in 𝐺.
Then the degree of 𝑣 is denoted by 𝑑𝑒𝑔𝐺 (𝑣) and defined to be the number of
edges incident with 𝑣.

Definition 2.5: (CHartrand,& Zhang, 2016) A graph 𝐺 is called r-regular if

degree of all vertices of 𝐺 are 𝑟.

Definition 2.6: (CHartrand& Zhang, 2016) A walk in a graph 𝐺 is a sequence of

alternating vertices and edegs 𝑣1, 𝑒1 , 𝑣2 , 𝑒2, … , 𝑣𝑛 , 𝑒𝑛 of 𝐺 with 𝑛 ≥ 0.

Definition 2.7: (CHartrand& Zhang, 2016) A path is a walk with no repeated

vertices.

Definition 2.8: (CHartrand, & Zhang, 2016) A trail is a walk with no repeated
edges.

Definition 2.9: (Wilosn,1996) Let 𝐺 be a graph and 𝑢, 𝑣 ∈ 𝑉(𝐺). Then we say

that 𝑢 and 𝑣 are connected vertices if there is a path between 𝑢 and 𝑣.

2
Definition 2.10: (Wilosn,1996) A graph 𝐺 is called connected if every two
vertices of 𝐺 are connected.

Definition 2.11: (Mahesh, 2011) Let 𝐺 be a connected graph and 𝑢, 𝑣 ∈ 𝑉 (𝐺 ).

The distance between two vertices 𝑢 and 𝑣 in 𝐺, is denoted by 𝑑(𝑢, 𝑣) and
defined as the length of a shortest u-v path in 𝐺.

Definition 2.12: (CHartrand,& Zhang, 2016) A closed path with 𝑛 vertices is

called a cycle of length 𝑛, which is denoted by 𝐶𝑛 .

Definition 2.13: (Kenneth, 2014) The complete graph of 𝑛 vertices is denoted

by 𝑘𝑛 in which every two vertices are adjacent.

Definition 2.14: (Jonathan & Jay ,2019) A bipartite graph is a graph in which
whose vertex set divided into two disjoint sets 𝑈 and 𝑉, every edge connects a
vertex in 𝑉 to a vertex in 𝑈. Vertex sets 𝑈 and 𝑉 are called the parts of the
graph.

Definition 2.15: (CHartrand, et al., 2016) The eccentricity 𝑒(𝑣) of a vertex 𝑣 in

a connected graph 𝐺 is the maximum distance between 𝑣 and all other vertices
of 𝐺.

Definition 2.16: (CHartrand, et al., 2016) The diameter 𝑑𝑖𝑎𝑚(𝐺) of a connected

graph 𝐺 is the largest eccentricity among the vertices of 𝐺.

Definition 2.17: (CHartrand, et al., 2016) The radius 𝑟𝑎𝑑(𝐺) is the smallest
eccentricity among the vertices of 𝐺.

Definition2.18: (Jonathan & Jay & ping ,2014) A central vertex in a graph is a
vertex whose eccentricity equals the radius of the graph.

Definition 2.19: (CHartrand, et al., 2016) The length of a longest cycle is the
circumference of 𝐺, denoted by 𝑐(𝐺).

3
Definition 2.20: (P.Dankelmann,1997) Let 𝐺 be a connected graph and 𝑣∈ 𝑉(𝐺),
the transmission of 𝑣 is denoted by 𝜎(𝑣) and defined by 𝜎(𝑣)=∑𝑢∈V(𝐺)𝑑(𝑣,
𝑢).

Definition 2.21: (P.Dankelmann, 1997) Let 𝐺 be a connected graph. The

transmission of 𝐺 is denoted by 𝜎(𝐺) and defined by 𝜎(𝐺) = ∑𝑢∈V(𝐺) 𝜎(𝑢).

Definition 2.22: (P.Dankelmann, 1997) Let 𝐺 be a connected graph. Then the

mean distance (or average distance) of 𝐺 is denoted by 𝜇 (𝐺 ) and defined by
𝜎(𝐺)
𝜇 (𝐺 ) = , where 𝑛 is the order of 𝐺. That is the average distance of a
𝑛(𝑛−1)

graph is the average value of the distance between all pairs of vertices in 𝐺.

Definition 2.23: (CHartrand& Zhang, 2016) A simple connected graph is called

planar if there is a way to draw it on a plane that no edges are intersect.

Definition2.24: (Jonathan & Jay,2019) A connected graph 𝐺 is Eulerian if there

exists a closed trail in 𝐺 containing all edge of 𝐺.

Definition2.25: (CHartrand& Zhang, 2016) A connected graph 𝐺 is called a

Hamiltonian graph if there is a cycle which includes every vertex of 𝐺 and the
cycle is called Hamiltonian cycle. A Hamiltonian walk in a graph 𝐺 is a walk
that passes through each vertex exactly once.

Definition 2.26: (Behzad & CHartrand, 1979) Let 𝐺 be a graph. The girth of a
graph 𝐺 is denoted by 𝑔(𝐺 ), and defined to be the length of shortest cycle in 𝐺.

Definition 2.27: (CHartrand& Zhang, 2016) If 𝐺 is a simple graph, then 𝐺 is K-

colorable if we can assign one of 𝐾 colors to each vertex so that adjacent
vertices have different colors. If 𝐺 is K-colorable, but not (𝑘-1)-colorable, we
say that 𝐺 is K-chromatic or chromatic number of 𝐺 is 𝐾, and write 𝜒(𝐺)= 𝑘.

4
Figure 2.1 the antiprism special graph ANn

5
 CHAPTER THREE
THE MEAN DISTANCE, OF THE ANTIPRISM
SPECIAL GRAPH 𝑨𝑵𝒏 WITH SOME GRAPHICAL
PROPERTIES
3.1 The Mean distance of the Antiprism special graph 𝑨𝑵𝒏
Definition 3.1.1: An antiprism graph is a graph corresponding to the
skeleton of antiprism. Antiprism graphs are therefore polyhedral and
planar. The order of antiprism graph is 2n and the size of Ann is 4n.

Theorem 3.1.2: The mean distance of the antiprism special graph 𝐴𝑁𝑛 is
𝑛( 𝑛+1)
𝜇(𝐴𝑁𝑛 ) = , for 𝑛 ≥ 3
2(2𝑛−1)

𝑃𝑟𝑜𝑜𝑓: Note that the transmission of a vertex 𝑣1 in the graph 𝐴𝑁𝑛 is

𝑛 𝑛
2 −1 2

𝜎 (𝑣1) = ∑ 𝑑 (𝑣1, 𝑣𝑖 ) + ∑ 𝑑 (𝑣1 , 𝑢𝑖 )

𝑖=1 𝑖=1

𝑛 𝑛
2 −1 2
𝑛
=2 ∑𝑖+ +2 ∑𝑖
2
𝑖=1 𝑖=1

𝑛2 𝑛 𝑛 𝑛2 𝑛
= − + + +
4 2 2 4 2
𝑛(𝑛+1)
= 𝜎 (𝑉2 ) = ⋯ = 𝜎 (𝑉𝑛 )
2

And the transmission of a vertex 𝑢1 in the graph 𝐴𝑁𝑛 is

𝑛 𝑛
−1
𝜎 (𝑢1 ) = ∑𝑖=1 𝑑 ( 𝑢1 , 𝑢𝑖 ) + ∑𝑖=1 𝑑 ( 𝑢1 , 𝑣𝑖 )
2 2

6
 𝑛 𝑛
−1
2 2
𝑛
=2 ∑𝑖+ +2 ∑𝑖
2
𝑖=1 𝑖=1

𝑛2 𝑛 𝑛 𝑛2 𝑛
= − + + +
4 2 2 4 2

𝑛(𝑛+1)
= = 𝜎 (𝑈2 ) = ⋯ = 𝜎 (𝑈𝑛 )
2

Now, the transmission of the graph ANn is

𝑛 𝑛

𝜎 ( 𝐴𝑁𝑛 ) = ∑ 𝜎 ( 𝑣𝑖 ) + ∑ 𝜎 ( 𝑢𝑖 )
𝑖=1 𝑖=1

𝑛2 ( 𝑛 + 1 ) 𝑛2 ( 𝑛 + 1 )
= +
2 2

2 𝑛2 ( 𝑛 + 1 )
=
2

= 𝑛2 ( 𝑛 + 1 )

So, the mean distance of the graph ANn is

𝜎 ( 𝐴𝑁𝑛 )
𝜇 ( 𝐴𝑁𝑛 ) =
2𝑛 ( 2𝑛 − 1 )

𝑛2 ( 𝑛 + 1 )
=
2𝑛 ( 2𝑛 − 1 )

𝑛 (𝑛 + 1 )
=
2 ( 2𝑛 − 1 )

7
Example 3.1.3 : we consider the antiprism special graph 𝐴𝑁9 ,
Then we can find the mean distance of AN9 directly bu using
theorem 3.1.2 as follows.

9(9+1) 90 45
𝜇 (𝐴𝑁9 ) = = =
2(2×9−1) 34 17

Figure 3.1 the Antiprism special graph 𝐴𝑁9

8
Example 3.1.4: We consider the antiprism special graph 𝐴𝑁8 of order
2(8) = 16 and size 32, as given in Figure 3.2 . Then the mean distance
of AN8 can be found directly by using Theorem 3.1.2 as

8(8+1) 65
𝜇 (𝐴𝑁8 ) = = = 2.09677
2(2×8−1) 31

Figure 3.2 the antiprism special graph 𝐴𝑁8

9
3.2 Some Graphical properties of the antiprism special
graph 𝑨𝑵𝒏
3.2.1 Regularity:
The graph antiprism special graph 𝐴𝑁𝑛 is a 4 - regular graph.

3.2.2 Girth of 𝑨𝑵𝒏 :

The Girth of the special graph 𝐴𝑁𝑛 is 𝑔(𝐴𝑁𝑛 ) = 3, since the length of the

shortest cycle in 𝐴𝑁𝑛 is 3

3.2.3 Planarity of 𝑨𝑵𝒏 :

The special graph 𝑨𝑵𝒏 is a planar graph, since we can draw it on a plane that
no any two edges are intersect.

3.2.4 Eulerian of 𝑨𝑵𝒏 :

The special graph ANn is Eulenan graph since the degree of every vertex is even.

3.2.5 Hamiltonian of 𝑨𝑵𝒏 :

The special graph 𝐴𝑁𝑛 is a Hamiltonian graph, since there is a cycle in 𝐴𝑁𝑛

containing all edges of 𝐴𝑁𝑛 .

3.2.6 Colour and Chromatic number 𝑨𝑵𝒏 :

4 𝑖𝑓 𝑛 is even.
𝜒(𝐴𝑁𝑛 ) = {
3 𝑖𝑓 𝑛 is odd.

3.2.7 Maximum degree of vertices of 𝑨𝑵𝒏 :

The Maximum degree of the vertices of the special graph antiprism, is ∆(𝐴𝑁𝑛 )= 4.

3.2.8 Minimum degree of vertices of 𝑨𝑵𝒏 :

The Minimum degree of the vertices of the special graph 𝑨𝑵𝒏 , is 𝛿(𝐴𝑁𝑛 )= 4.

10
3.2.9 connected graph of ANn

The special graph ANn is connected graph, since every two distinct vertices of
ANn are connected.

3.2.10 Circunference of ANn

The Circumference of the Antiprism special graph ANn is (ANn) = 2n, Since the
largest cycle in ANn contains 2n edges.

3.2.11 Eccentricity of Vertices of ANn

𝑛
The eccentricity of the Vertices of the graph ANn is e(v) =
2

3.2.12 Radius of ANn

𝑛
The Radius of ANn is rad ( ANn) =
2
𝒏
3.2.13 Diameter of ANn max (v) =
𝟐
𝑛
The diameter of the graph ANn is diam (ANn) =
2

11
 Reference:
Behzad,M.,& Chartrand, G. (1976) Graph and Diagraphs. California: Wodsworth

Jonathan, L.G, & Jay, Y.(2019). Graph theory and it’s Apllications. London:
Taylor and Francis group. LLC.

Chartrand, G, Lesniak, L. & Zhang, P., 2016. Graphs & Digraohs 6 th ed. New
work: CRC.

Mahsesh C. Prajapati, 2011, Distance in graph theory and it’s Application

Advanced Engineering technology, Vol II/issue IV.

Raluca Gera & Teresa w.Haynes. stepnent. Hedetnieml Y.(2018). Switzerland.

Ed 1st. springer.

Kon khee meng & dong fengming & Tay eng Guan. Y. (2007). London. Ed1st .
world Scientific.

11
 ‫ثوختة‬

‫لةم ثرذةية دا كار لةسةر جؤريَكى تايبةت لة طراف بة ناوى ‪ Antiprism‬طراف دةكةين كة تيَيدا تيَكراى دوورى‬

‫)‪𝑛(𝑛+1‬‬
‫= ) 𝑛𝑁𝐴( 𝜇 كاتيَك ‪ 𝑛 ≥ 3‬لةطةل ثيَدانى‬ ‫ئةم طرافة تايبةتة دةدؤزينةوة كة بريتية لة‬
‫)‪2(2𝑛−1‬‬

‫ضةند منوونةيةكى سةرنج راكيَشى دةربارةى بابةتةكة‪.‬‬

‫هةروةها ديراسةكردنى ضةند سيفةتيَكى طرافى ئةم طرافى ئةم طرافة تايبةتة وةك ريَكى‪ ,‬ناوقةد‪ ,‬روو تةختى‪,‬‬

‫ئويلةرى‪ ,‬هاملتؤنى ‪ ,‬رةنط كردن و دؤزينةوةى كةمرتين ذمارةى رةنطى طرافةكة‪ ,‬طةورةترين و بضووكرتين ثلةى‬

‫طرافة‪ ,‬شيضوةى ترية و تريةى طرافةكة‪.‬‬

‫‪a‬‬
 ‫اخلالصة‬
‫)‪𝑛(𝑛+1‬‬
‫= ) 𝑛𝑁𝐴( 𝜇‬ ‫يف هذا املشروغ نعمل هلى اجياد معمل املسافة للبيان اخلاص باسم ‪ Antiprism‬وهي‬
‫)‪2(2𝑛−1‬‬

‫عندما ‪ . 𝑛 ≥ 3‬مع اعطاء حبث أمثلة مثرية و متعلقة باملوضوع‪.‬‬

‫باالفافة على ذالك نقوم بدراسة بعض الصفات البيانية للبيان اخلاص ‪ , ANn‬مثل االنتظام‪ ,‬اخلصر‪ ,‬املستوية‪,‬‬

‫االويلرى‪ ,‬اهلاولتوني‪ ,‬التلوين‪ ,‬اعظم و أقل درجة للبان وكذالك نصف قطر و قطر البان‪.‬‬

‫‪b‬‬