On the Sunflower Special Graph 𝑺𝒇𝒏

Research Project

Submitted to the Department of Mathematics in partial fulfillment of

the requirements for the degree of BSc. in Mathematics

Prepared by:
Zahra Zrar Majeed Ahmad

Supervised by:

Assist. Prof. Dr. Rashad Rashid Haji

April– 2024
 Certification of the Supervisor

I certify that this work was prepared under my supervision at the Department
of Mathematics / College of Education / Salaheddin University- Erbil in partial
fulfillment of the requirements for the degree of Bachelor 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.

I would like to express my special thanks to my supervisor Assist. Prof. Dr.

Rashad Rashid Haji, for his guidance, support, and encouragement throughout
the entire research process, 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 Elaf Salh.

My thanks appreciations go to Mathematical Department and all my valuable

teachers.

iii
 ABSTRACT

In this work we find the mean distance, the detour index and the detour
2(3𝑛−5)
polynomial of the Sunflower special graph 𝑆𝑓𝑛 which are 𝜇(𝑆𝑓𝑛 ) = , for
2𝑛+1

𝑛 ≥ 5, 𝑑𝑑(𝑆𝑓𝑛 ) = 𝑛(3𝑛2 + 2𝑛 − 1), for 𝑛 ≥ 3, and 𝐷(𝑆𝑓𝑛 , 𝑥) =

𝑛−1

𝑛(𝑥 𝑛 + 𝑥 2𝑛−1 + 𝑥 2𝑛 ) + 2𝑛 ∑ 𝑥 𝑛+𝑖 , for 𝑛 ≥ 3 respectively, with givin

𝑖=1

interesting examples about the subject.

Moreover, we study some graphical Properties of the graph 𝑆𝑓𝑛 such as

coloring and the chromatic number, girth, non Eulerian, planarity, non-regularity,
connectedness, maximum and minimum degree of vertices, adjacency matrix,
incidence matrix, non-Hamiltonian, center, circumference, eccentricity, radius,
diameter, cut vertices, circuit and block.

iv
Table of Contents
Certification of the Supervisor ................................................................................................ ii
Acknowledgment .....................................................................................................................iii
ABSTRACT ............................................................................................................................. iv
Table of Contents ...................................................................................................................... v
List of Figures ........................................................................................................................... v
CHAPTER ONE ....................................................................................................................... 1
Introduction .............................................................................................................................. 1
CHAPTER TWO ...................................................................................................................... 3
Background ............................................................................................................................... 3
CHAPTER THREE.................................................................................................................. 7
The Mean Distance, Detour Index And Detour Polynomial Of The Sunflower Special
Graph 𝑺𝒇𝒏 With Some Graphical Properties ....................................................................... 7
3.1. The Mean distance of the Sunflower special graph 𝑺𝒇𝒏.........................................................7
3.2. The Detour Index And Detour Polynomial of the Sunflower special graph 𝑺𝒇𝒏 .............. 12
3.3. Some graphical properties of the Sunflower special graph (𝑺𝒇𝒏), for every positive integer
𝒏 ≥ 𝟑. ................................................................................................................................................ 16
References................................................................................................................................ 20
‫ الخالصة‬......................................................................................................................................... a
‫ پوختە‬............................................................................................................................................ b

List of Figures

Figure 1: The Sunflower special graph 𝑆𝑓𝑛 ............................................................................... 7

Figure 2: The Sunflower special graph 𝑆𝑓3 ............................................................................. 10
Figure 3: The Sunflower special graph 𝑆𝑓4 ............................................................................. 11
Figure 4: The Sunflower special graph 𝑆𝑓10 .......................................................................... 11
Figure 5: The Sunflower special graph 𝑆𝑓8 ............................................................................. 13
Figure 6: The Sunflower special graph 𝑆𝑓9 ............................................................................. 15
Figure 7: The Sunflower special graph 𝑆𝑓5 ............................................................................. 19
Figure 8: The Sunflower special graph 𝑆𝑓6 ............................................................................. 19

v
 CHAPTER ONE
Introduction

The origin of graph theory started with the problem of Konigsberg bridge,
in 1735. This problem leads to the concept of Eulerian Graph. Euler studied
the problem of Konigsberg bridge and constructed a structure to solve the
problem called Eulerian graph. (Kaur, 2020) (Chartrand, et al., 2016)

Graph Theory is one of the significant and important area in

Mathematics, which is used in Network Security. Cryptography is art of
science to achieving security by encoding message to make it non-readable
(secretive) to unintended users. (Dharwadker, 2006)

Graph theory is rapidly moving into the mainstream of mathematics

mainly because of its applications in diverse fields which include Biology,
Electronic engineering, Communication Networks and Mathematics. The
powerful combinatorial methods found in graph theory have also been used
to prove significant and well-known results in a variety of areas in
mathematics itself. There are many examples of applications of graph theory
to other parts of mathematics. Graph theoretical ideas are highly utilized in
Technology. Especially, in research areas of computer science such data
mining, image segmentation, clustering, image capturing, networking etc.

(Kaur, 2020)

Graph theoretical concepts are widely used in different areas. They

include study of molecules, construction of bonds in chemistry and the study
of atoms, where vertices represent atom and edges bonds. Similarly, Graph
theory is used in biology and conservation efforts where a vertex represents
regions where certain species exist and the edges represent migration path or
movement between the regions. This information is important when looking

1
at breeding patterns or tracking the spread of disease, parasites and to study
the impact of migration that affect other species. Graph theoretical concept
are widely used in Operation Research. (Kaur, 2020)

Graph Theory is used to study molecules in chemistry, graph makes a

natural model for molecules, where vertices represent atom and edges bonds.
The importance of graph theory for chemistry stems mainly from the
existence of the phenomenon of isomerism, which is rationalized by
chemical structure theory. (Kaur, 2020)

In Physics, the three dimensional structure of complicated simulated

atomic structures can be studied quantitatively by gathering statistics on
graph-theoretic properties related to the topology of the atoms. For example,
Franzblau’s shortest-path (SP) rings. (Kaur, 2020)

In mathematics, graphs are useful in geometry and certain parts of

topology, e.g. Knot Theory. Algebraic graph theory has close links with
group theory. Graph theory is a very natural and powerful tool in
combinatorial Operations Research. (Kaur, 2020)

A graph can be used to model the street system of a town. Of course,

as a town grows in size, so too does not the graph at model it. (Prajapati,
2011)

2
 CHAPTER TWO
Background

Definition 2.1. (Behzad, et al., 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. (L.Gross, et al., 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, et al., 1979) In a graph 𝐺 two vertices that are joined
by an edge are called adjacent vertices.

Definition 2.4. (L.Gross, et al., 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, et al., 2016) A graph 𝐺 is called r-regular if

degree of all vertices of 𝐺 are 𝑟.

Definition 2.6. (Chartrand, et al., 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, et al., 2016) A path is a walk with no repeated

vertices.

Definition 2.8. (Chartrand, et al., 2016) A trail is a walk with no repeated

edges.

Definition 2.9. (J.wilson, 1996) Let 𝐺 be a graph and 𝑢, 𝑣 ∈ 𝑉(𝐺). Then we

say that 𝑢 and 𝑣 are connected vertices if there is a path between 𝑢 and 𝑣.
3
Definition 2.10. (J.wilson, 1996) A graph 𝐺 is called connected if every two
vertices of 𝐺 are connected.

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

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

Definition 2.12. (Chartrand, et al., 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. (L.Gross, et al., 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 𝑈. The 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 the graph 𝐺.

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 (Kenneth, 2014) (Kenneth,

2014)𝑟𝑎𝑑(𝐺) of the connected graph 𝐺 is the smallest eccentricity among the
vertices of 𝐺.

Definition2.18. (Prajapati, 2011) A central vertex in a graph is a vertex

whose eccentricity equals to the radius of the graph.

Definition 2.19. (Chartrand, et al., 2016) The length of a longest cycle in a graph
𝐺 is the circumference of 𝐺, which is denoted by 𝑐(𝐺).
4
Definition 2.20. (T.Reti, 2020) Let 𝐺 be a connected graph and 𝑣∈ 𝑉(𝐺). The
transmission of 𝑣 is denoted by 𝜎(𝑣) and defined by 𝜎(𝑣)=∑𝑢∈V(𝐺)𝑑(𝑣,
𝑢).

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

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

Definition 2.22. (P.Dankkelmann, 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
𝑛(𝑛−1)

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

Definition 2.23. (Chartrand, et al., 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. (L.Gross, et al., 2019) A connected graph 𝐺 is Eulerian if

there exists a closed trail in 𝐺 containing all edges of 𝐺.

Definition2.25. (Chartrand, et al., 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, et al., 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 (Behzad, et al., 1979) 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 𝐾-colorable, but not (𝑘-1)-colorable,
we say that 𝐺 is 𝑲-chromatic or the chromatic number of 𝐺 is 𝐾, and written
by 𝜒(𝐺)= 𝑘.

5
Definition 2.28. (Chartrand, et al., 2016) A proper k-edge coloring proper edge
coloring is an assign one of 𝐾 colors to each edges such that no two adjacent
edges receive the same color. The chromatic index of 𝐺, or edge-chromatic
number, is the minimal 𝑘 such that G has a k-edge coloring. It is denoted by
𝜒 ′ (𝐺)= 𝑘.

Definition 2.29. (J.wilson, 1996) If 𝐺 is a graph with vertices labelled

{1,2,3, … , 𝑛}, its adjacency matrix A is the 𝑛 × 𝑛 matrix whose 𝑖𝑗‐ 𝑡ℎ entry is
1 if i and j adjacent and 0 otherwise.

Definition 2.30. (Wilson, 1996) Let G be a simple graph of order n and size
m, then the incidence matrix 𝑀 is the 𝑛 × 𝑚 matrix whose 𝑖𝑗 − 𝑡ℎ entry is 1
if vertex 𝑖 is incident to edge 𝑗, and 0 otherwise.

Definition 2.31. (Muhammed & Ali, 2013) Let 𝐺 be a connected graph. The
detour distance D(u,v) between two vertices 𝑢 and 𝑣 in 𝐺 is the longest length
of a u-v path in 𝐺. The detour index of 𝐺 is defined by dd(G) =
∑𝑢,𝑣∈𝑉(𝐺) 𝐷 (𝑢, 𝑣) and the detour Polynomial of 𝐺 is 𝐷(𝐺; 𝑥) =
∑𝑢,𝑣∈𝑉(𝐺) 𝑥 𝐷 (𝑢,𝑣) .

Definition 2.32. (L.Gross, et al., 2019) Let G be a connected graph. A vertex

v of G is called a cut vertex of G, if 𝐺 − 𝑣 (Remove v from G) results a
disconnected graph.

Definition 2.33. (L.Gross, et al., 2019) A block is a maximal connected

subgraph of a given graph G that has no cut vertex.

Definition 2.34. (Chartrand, et al., 2016) A circuit is path that begins and
ends at the same vertex.

6
 CHAPTER THREE
The Mean Distance, Detour Index And Detour Polynomial
Of The Sunflower Special Graph 𝑺𝒇𝒏 With Some
Graphical Properties

3.1. The Mean distance of the Sunflower special graph 𝑺𝒇𝒏

Definition 3.1.1. (Daoud & Mohamad, 2017)The Sunflower special graph 𝑆𝑓𝑛 is
a graph that always has an odd number of vertices 2𝑛 + 1, Say 𝑣𝑜 , 𝑣1 , … , 𝑣𝑛 ,
𝑢1 , … , 𝑢𝑛 and the size of 𝑆𝑓𝑛 is 𝑚 = 4𝑛. The central vertex 𝑣𝑜 has degree
𝑑𝑒𝑔(𝑣𝑜 ) = 𝑛, the vertices 𝑣1 , … , 𝑣𝑛 have degree 5. And the vertices 𝑢1 , … , 𝑢𝑛
have degree 2, as given in Figure 1.

Figure 1: The Sunflower special graph 𝑆𝑓𝑛

7
Theorem 3.1.2. The mean distance of the Sunflower special graph 𝑆𝑓𝑛 where is
2(3𝑛−5)
𝜇(𝑆𝑓𝑛 ) = , for every positive integer 𝑛 ≥ 5.
2𝑛+1

Proof: Note that the transmission of a vertex 𝑣𝑜 in the graph 𝑆𝑓𝑛 is

𝑛 𝑛

𝜎(𝑣𝑜 ) = ∑ 𝑑(𝑣𝑜 , 𝑣𝑖 ) + ∑ 𝑑(𝑣𝑜 , 𝑢𝑖 ) = 𝑛 + 2𝑛 = 3𝑛.

𝑖=1 𝑖=1

And the transmission of a vertex 𝑣1 in the graph 𝑆𝑓𝑛 is

𝑛 𝑛

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

𝑖=0 𝑖=1

= 5(𝑛) + (𝑛 − 1)(2) + (𝑛 − 4)(3)

= 5𝑛 − 9.

Note that the vertices 𝑣1 , 𝑣2 , … , 𝑣𝑛 are symmetric in adjacency with the other
vertices in the graph 𝑆𝑓𝑛 , so 𝜎(𝑣1 ) = 𝜎(𝑣2 ) = ⋯ = 𝜎(𝑣𝑛 ).

Also the transmission of a vertex 𝑢1 in the graph 𝑆𝑓𝑛 is

𝑛 𝑛

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

𝑖=0 𝑖=1

= 2(1) + 5(2) + (𝑛 − 2)(3) + (𝑛 − 5)(4) = 7𝑛 − 14.

Also the vertices 𝑢1 , 𝑢2 , … , 𝑢𝑛 are symmetric adjacency with the other vertices
in the graph 𝑆𝑓𝑛 , so 𝜎(𝑢1 ) = 𝜎(𝑢2 ) = ⋯ = 𝜎(𝑢𝑛 ).

Thus, the transmission of the graph 𝑆𝑓𝑛 is

𝑛 𝑛

𝜎(𝑆𝑓𝑛 ) = 𝜎(𝑣𝑜 ) + ∑ 𝜎(𝑣𝑖 ) + ∑ 𝜎(𝑢𝑖 )

𝑖=1 𝑖=1

= 𝜎(𝑣𝑜 ) + 𝑛 𝜎(𝑣1 ) + 𝑛 𝜎(𝑢1 )

𝜎(𝑆𝑓𝑛 ) = 3𝑛 + 𝑛(5𝑛 − 9) + 𝑛(7𝑛 − 14) = 4𝑛(3𝑛 − 5).

8
Now the mean distance of 𝑆𝑓𝑛 is

𝜎(𝑆𝑓𝑛 ) 4𝑛(3𝑛−5) 2(3𝑛−5)

𝜇 (𝑆𝑓𝑛 ) = = = .
(𝑛−1)(𝑛) (2𝑛)(2𝑛+1) 2𝑛+1

■
Proposition 3.1.3. The mean distance of the Sunflower special graph 𝑆𝑓3 is
27
𝜇(𝑆𝑓3 ) = .
7

Proof: The transmission of a vertex 𝑣𝑜 in the graph 𝑆𝑓3 as given in Figure 2 is

3 3

𝜎(𝑣𝑜 ) = ∑ 𝑑(𝑣𝑜 , 𝑣𝑖 ) + ∑ 𝑑(𝑣𝑜 , 𝑢𝑖 ) = 3 + 3(2) = 9.

𝑖=1 𝑖=1

And the transmission of a vertex 𝑣1 in the graph 𝑆𝑓3 is

3 3

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

𝑖=0 𝑖=1

= 3(1 + 1 + 1) + 3(1 + 2 + 1) = 21.

Note that the vertices 𝑣1 , 𝑣2 , 𝑣3 are symmetric in adjacency with the other vertices
in the graph 𝑆𝑓3 , so 𝜎(𝑣1 ) = 𝜎(𝑣2 ) = 𝜎(𝑣3 ).

Also the transmission of a vertex 𝑢1 in the graph 𝑆𝑓3 is

3 3

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

𝑖=0 𝑖=1

= 3(2 + 1 + 1 + 2) + 3(2 + 2) = 30.

Also the vertices 𝑢1 , 𝑢2 , 𝑢3 are symmetric adjacency with the other vertices in
the graph 𝑆𝑓3 , so 𝜎(𝑢1 ) = 𝜎(𝑢2 ) = 𝜎(𝑢3 ).

Thus, the transmission of the graph 𝑆𝑓3 is

3 3

𝜎(𝑆𝑓3 ) = 𝜎(𝑣𝑜 ) + ∑ 𝜎(𝑣𝑖 ) + ∑ 𝜎(𝑢𝑖 )

𝑖=1 𝑖=1

9
𝜎(𝑆𝑓3 ) = 𝜎(𝑣𝑜 ) + 3(𝜎(𝑣1 )) + 3(𝜎(𝑢1 ))

𝜎(𝑆𝑓3 ) = 9 + 3(21) + 3(30) = 162.

Now the mean distance of 𝑆𝑓3 is

𝜎(𝑆𝑓 )
𝑛 162 27
𝜇 (𝑆𝑓𝑛 ) = (2𝑛+1)(2𝑛) = (7)(6) = .
7

Figure 2: The Sunflower special graph 𝑆𝑓3

Proposition 3.1.4. The mean distance of the Sunflower special graph 𝑆𝑓4 is
107
𝜇(𝑆𝑓4 ) = .
18

Proof: The transmission of a vertex 𝑣𝑜 in the graph 𝑆𝑓4 as given in Figure 3 is

4 4

𝜎(𝑣𝑜 ) = ∑ 𝑑(𝑣𝑜 , 𝑣𝑖 ) + ∑ 𝑑(𝑣𝑜 , 𝑢𝑖 ) = 4 + 4(2) = 12.

𝑖=1 𝑖=1

And the transmission of a vertex 𝑣1 in the graph 𝑆𝑓4 is

4 4

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

𝑖=0 𝑖=1

= 4(1 + 1 + 1 + 2) + 4(1 + 2 + 1 + 2) = 44.

Note that the vertices 𝑣1 , 𝑣2 , 𝑣3 , 𝑣4 are symmetric in adjacency with the other
vertices in the graph 𝑆𝑓4 , so 𝜎(𝑣1 ) = 𝜎(𝑣2 ) = 𝜎(𝑣3 ) = 𝜎(𝑣4 ).

Also the transmission of a vertex 𝑢1 in the graph 𝑆𝑓4 is

4 4

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

𝑖=0 𝑖=1

= 4(2 + 1 + 1 + 2 + 2) + 4(2 + 2 + 3) = 60.

Also the vertices 𝑢1 , 𝑢2 , 𝑢3 , 𝑢4 are symmetric adjacency with the other vertices
in the graph 𝑆𝑓4 , so 𝜎(𝑢1 ) = 𝜎(𝑢2 ) = 𝜎(𝑢3 ) = 𝜎(𝑢4 ).

10
Thus, the transmission of the graph 𝑆𝑓4 is
4 4

𝜎(𝑆𝑓4 ) = 𝜎(𝑣𝑜 ) + ∑ 𝜎(𝑣𝑖 ) + ∑ 𝜎(𝑢𝑖 )

𝑖=1 𝑖=1

= 𝜎(𝑣𝑜 ) + 4(𝜎(𝑣1 )) + 4((𝑢1 ))

= 12 + 4(44) + 4(60) = 428.

Now the mean distance of 𝑆𝑓4 is

𝜎(𝑆𝑓 )
𝑛 428 107
𝜇 (𝑆𝑓4 ) = (2𝑛+1)(2𝑛) = (9)(8) = . Figure 3: The Sunflower special graph 𝑆𝑓4
18

Example 3.1.5. We consider the sunflower special graph 𝑆𝑓10 of order 2(10) +
1 = 21 and size 40, as given in Figure 4.We can find then the mean distance of
𝑆𝑓10 by using Theorem 3.1.2 directly as

𝜎(𝑆𝑓 )
10 2(3(10)−5) 50 5
𝜇 (𝑆𝑓10 ) = (21)(20) = (21)(20)
= = .
420 42

Figure 4: The Sunflower special graph 𝑆𝑓10

11
3.2. The Detour Index And Detour Polynomial of the Sunflower
special graph 𝑺𝒇𝒏

Theorem 3.2.1. The detour index of the Sunflower special graph 𝑆𝑓𝑛 is
𝑑𝑑(𝑆𝑓𝑛 )=𝑛(3𝑛2 + 2𝑛 − 1), for every positive integer 𝑛 ≥ 3.

Proof: Consider the graph 𝑆𝑓𝑛 as given in Figure 1, then the detour distance of
a vertex 𝑣𝑜 is
𝑛 𝑛

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

𝑖=1 𝑖=1

= 𝑛(4𝑛 − 1) .
And the detour distance of a vertex 𝑣1 is
𝑛 𝑛

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

𝑖=0 𝑖=1
3 3
= 𝑛2 − 1 + 𝑛2
2 2
= 3𝑛2 − 1 .

Since the vertices 𝑣𝑖 , for all 𝑖 = 1,2,3, … , 𝑛 are symmetric in adjacency with
the other vertices of the graph 𝑆𝑓𝑛 , so 𝑑𝐷 (𝑣1 ) = 𝑑𝐷 (𝑣2 ) = ⋯ = 𝑑𝐷 (𝑣𝑛 ).
And the detour distance of a vertex 𝑢1 is
𝑛 𝑛

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

𝑖=0 𝑖=1

3𝑛2 + 4𝑛 − 1 3𝑛2 − 4𝑛 + 1
= +
2 2
= 3𝑛2 .
Since the vertices 𝑢𝑖 , for all 𝑖 = 1,2, … , 𝑛 are symmetric in adjacency with the
other vertices of the graph 𝑆𝑓𝑛 , so 𝑑𝐷 (𝑢1 ) = 𝑑𝐷 (𝑢2 ) = ⋯ = 𝑑𝐷 (𝑢𝑛 ).

12
Now the detour index of the graph 𝑆𝑓𝑛 is
𝑛 𝑛
1
𝑑𝑑(𝑆𝑓𝑛 ) = [𝑑𝐷 (𝑣𝑜 ) + ∑ 𝑑𝐷 (𝑣𝑖 ) + ∑ 𝑑𝐷 (𝑢𝑖 )]
2
𝑖=1 𝑖=1
1
= [𝑑𝐷 (𝑣𝑜 ) + 𝑛 𝑑𝐷 (𝑣1 ) + 𝑛 𝑑𝐷 (𝑢1 )]
2
1
= [4𝑛2 − 𝑛 + 𝑛(3𝑛2 − 1) + 𝑛(3𝑛2 )]
2
= 3𝑛3 + 2𝑛2 − 𝑛
𝑑𝑑(𝑆𝑓𝑛 ) = 𝑛(3𝑛2 + 2𝑛 − 1).
■
Example 3.2.2. Consider the Sunflower special graph 𝑆𝑓8 of order 2(8) +
1 = 17 and size 32, as given in Figure 5.We can find then the detour index of
𝑆𝑓8 by using Theorem 3.2.1 directly as:
𝑑𝑑(𝑆𝑓8 ) = (8)(3(8)2 + 2(8) − 1) = 1656.

Figure 5: The Sunflower special graph 𝑆𝑓8

13
Theorem 3.2.3. The detour polynomial of the Sunflower special graph 𝑆𝑓𝑛 is
𝑛−1

𝐷(𝑆𝑓𝑛 , 𝑥) = 𝑛(𝑥 𝑛 + 𝑥 2𝑛−1 + 𝑥 2𝑛 ) + 2𝑛 (∑ 𝑥 𝑛+𝑖 ) , for every positive

𝑖=1

integer 𝑛 ≥ 3.

Proof: By using the definition of detour polynomial, we have the detour

polynomial of the graph 𝑆𝑓𝑛 is

𝐷(𝑆𝑓𝑛 , 𝑥) = ∑ 𝑥 𝐷(𝑢,𝑣)
𝑢,𝑣∈𝑉(𝐺)
1
= {𝑛𝑥 𝐷(𝑣𝑜 ,𝑣1 ) + 𝑛𝑥 𝐷(𝑣𝑜 ,𝑢1) + 𝑛𝑥 2𝑛−1 + 2𝑛[𝑥 𝑛+2 + 𝑥 𝑛+4 + ⋯ +
2

𝑥 𝑛+(𝑛−2) ]+𝑛𝑥 𝑛 + 2𝑛[𝑥 𝑛+1 + 𝑥 𝑛+3 + ⋯ + 𝑥 𝑛+(𝑛−1) ]+𝑛𝑥 2𝑛 +

2𝑛[𝑥 𝑛+2 + 𝑥 𝑛+4 + ⋯ + 𝑥 𝑛+(𝑛−2) ]+𝑛𝑥 𝑛 + 2𝑛[𝑥 𝑛+1 + 𝑥 𝑛+3 +
… + 𝑥 𝑛+(𝑛−1) ]}.

where 𝑛𝑥 𝐷(𝑣𝑜 ,𝑣1 ) = 𝑛𝑥 2𝑛−1 and 𝑛𝑥 𝐷(𝑣𝑜 ,𝑢1) = 𝑛𝑥 2𝑛 . Then

𝑛−2 𝑛
𝑛 2𝑛−1 2𝑛 𝑛+2𝑖
𝐷(𝑆𝑓𝑛 , 𝑥) = 𝑛(𝑥 + 𝑥 + 𝑥 ) + 2𝑛 (∑𝑖=1 𝑥
2
+ ∑𝑖=1 𝑥 𝑛+(2𝑖−1) ).
2

𝑛−1

𝐷(𝑆𝑓𝑛 , 𝑥) = 𝑛(𝑥 𝑛 + 𝑥 2𝑛−1 + 𝑥 2𝑛 ) + 2𝑛 ∑ 𝑥 𝑛+𝑖 .

𝑖=1

14
Example 3.2.4. Consider the Sunflower special graph 𝑆𝑓9 the detour
polynomial of 𝑆𝑓9 can be found by using Theorem 3.2.2 directly as follows:

𝐷(𝑆𝑓9 , 𝑥) = 9(𝑥 9 + 𝑥 2(9)−1 + 𝑥 2(9) ) + 2(9) (∑ 𝑥 9+𝑖 ).

𝑖=1

𝐷(𝑆𝑓9 , 𝑥) = 9(𝑥 9 + 𝑥 17 + 𝑥 18 ) + 18(𝑥 10 + 𝑥 11 + 𝑥 12 + 𝑥 13 + 𝑥 14 + 𝑥 15 +

𝑥 16 + 𝑥 17 ) .

𝐷(𝑆𝑓9 , 𝑥) = 9(𝑥 9 + 2𝑥 10 + 2𝑥 11 + 2𝑥 12 + 2𝑥 13 + 2𝑥 14 + 2𝑥 15 + 2𝑥 16
+ 3𝑥 17 + 𝑥 18 ).

Figure 6: The Sunflower special graph 𝑆𝑓9

15
3.3. Some graphical properties of the Sunflower special graph
(𝑺𝒇𝒏 ), for every positive integer 𝒏 ≥ 𝟑.

3.3.1. Non Regularity:

The special graph 𝑆𝑓𝑛 is not a Regular graph, for every positive integer 𝑛 ≥ 3.

3.3.2. Girth of 𝑺𝒇𝒏 :

The Girth of the special graph 𝑆𝑓𝑛 is 𝑔(𝑆𝑓𝑛 ) = 3, since the length of the
shortest cycle in 𝑆𝑓𝑛 .

3.3.3. Planarity of 𝑺𝒇𝒏 :

The special graph 𝑆𝑓𝑛 is planar graph, since we can draw it on a plane that no
edges are intersect.

3.3.4. Non Eulerian of 𝑺𝒇𝒏 :The special graph 𝑆𝑓𝑛 is not an Eulerian graph,
since there is a vertex in 𝑆𝑓𝑛 of odd degree.

3.3.5. Non Hamiltonian of 𝑺𝒇𝒏 :

The graph 𝑆𝑓𝑛 is not a Hamiltonian graph, since 𝑆𝑓𝑛 has no cycle contains all
edges of 𝑆𝑓𝑛 .

3.3.6. Chromatic number 𝑺𝒇𝒏 :

3 if 𝑛 is even integer for n ≥ 3.

𝜒(𝑆𝑓𝑛 ) = {
4 if 𝑛 is odd integer for n ≥ 3.

As shown in figure (9-a) we see that if 𝑛 is even, then the different adjacent
vertices are 2 colors and the center vertex 𝑣0 is should be colored by a different
color. So, we need 3 different colors.
Similarly, in figure (8-a) we see that if 𝑛 is odd, then the different adjacent
vertices are 3 colors and the center vertex 𝑣0 is should be colored by a different
color. So, we need 4 different colors.

16
3.3.7. Chromatic index of 𝑺𝒇𝒏 :

4 + 𝑛 if 𝑛 is even integer for n ≥ 3.

𝜒 ′ (𝑆𝑓𝑛 ) = {
5 + 𝑛 if 𝑛 is odd integer for n ≥ 3.

As shown in figure (9-b) we see that if 𝑛 is even, then the different adjacent
edges are 4 colors and the center vertex 𝑣0 is should be n colors by a different
color. So, we need 4 + 𝑛 different colors.
Similarly, in figure (8-b) we see that if 𝑛 is odd, then the different adjacent
edges are 5 colors and the center vertex 𝑣0 is should be n colors by a different
color. o, we need 5 + 𝑛 different colors.

3.3.8. Center of 𝑺𝒇𝒏 :

The Center of the special graph 𝑆𝑓𝑛 is z(𝑆𝑓𝑛 )= 𝑣0 .

3.3.9. Maximum degree of vertices of 𝑺𝒇𝒏 :

The Maximum degree of the vertices of the special graph Sunflower, is

∆(𝑆𝑓𝑛 )= 𝑛 , for every positive integer 𝑛 ≥ 3.

3.3.10. Minimum degree of vertices of 𝑺𝒇𝒏 :

The Minimum degree of the vertices of the special graph Sunflower, is

𝛿(𝑆𝑓𝑛 )= 2 , for every positive integer 𝑛 ≥ 3.

3.3.11. Connected graph of 𝑺𝒇𝒏 :

The special graph 𝑆𝑓𝑛 is a Connected graph, since every two vertices of graph
𝑆𝑓𝑛 are connected.

3.3.12. adjacency matrix of 𝑺𝒇𝒏 :

since 𝑣0 is adjacent with 𝑣𝑖 , for all 𝑖 = 1, 2,…,𝑛, So the entry is 1 and

since 𝑣0 is non adjacent with 𝑢𝑖 , for all 𝑖 = 1, 2, … , 𝑛, So the entry is 0.
Furthermore each with 𝑣𝑖 is adjacent with 𝑢𝑖 and 𝑢𝑖+1 , for all 𝑖 = 1, 2, … , 𝑛 − 1,

17
also 𝑣𝑖 is adjacent with 𝑣𝑖−1 and 𝑣𝑖+1 , for all 𝑖 = 2, … , 𝑛 − 1, also 𝑣1 is
adjacent with 𝑣2 and 𝑣𝑛 . Morover, the vertex 𝑣𝑛 is adjacent 𝑢𝑛 and 𝑢1 , also 𝑣𝑛 is
adjacent with 𝑣𝑛−1 and 𝑣1 . As given in Figure 4.

3.3.13. incidency matrix of 𝑺𝒇𝒏 :

since 𝑣0 is an incident with the edges 𝑣0 𝑣𝑖 , for all 𝑖 = 1, 2,…,𝑛, So the entry is
1. and since 𝑣0 is non incident with the edges 𝑣0 𝑢𝑖 , for all 𝑖 = 1, 2, … , 𝑛, So the
entry is 0. Furthermore each vertex 𝑣𝑖 is incident with the edges 𝑣𝑖 𝑢𝑖 and 𝑣𝑖 𝑢𝑖+1 ,
for all 𝑖 = 1, 2, … , 𝑛 − 1, also 𝑣𝑖 is incident with the edges 𝑣𝑖 𝑣𝑖+1 , for all 𝑖 =
1, … , 𝑛-1 also is incident with the edges 𝑣𝑖 𝑣𝑖−1 , for all 𝑖 = 2,3, … , 𝑛 and 𝑣1 is
incident with the edges 𝑣1 𝑣𝑛 . So 𝑣𝑛 is incident with the 𝑣𝑛 𝑢1 , also 𝑣𝑛 is incident
with the 𝑣𝑛 𝑣1 . Otherwise the entry is 0.

Morover, the vertex 𝑢𝑖 is incident with the 𝑢𝑖 𝑣𝑖−1 , for all 𝑖 = 2,3, … , 𝑛 also 𝑢1
is incident with the 𝑣1 𝑢𝑛 . Otherwise is 0. As given in Figure 4.

3.3.14. Circumference of 𝑺𝒇𝒏 :

The circumference of 𝑆𝑓𝑛 is 𝐶(𝑆𝑓𝑛 )= 2𝑛.

3.3.15. Eccentricity of vertices of 𝑺𝒇𝒏 :

The eccentricity of 𝑣𝜖𝑉(𝐺) is defined by

2 if 𝑣 = 𝑣0.
𝑒(𝑣)= {3 if 𝑣 = 𝑣𝑖, 𝑖 = 1,2,…,𝑛.
4 if 𝑣 = 𝑢𝑖, 𝑖 = 1,2,…,𝑛.

3.3.16. Radius of 𝑺𝒇𝒏 :

The radius of 𝑆𝑓𝑛 is 𝑟𝑎𝑑(𝑆𝑓𝑛 )=2.

3.3.17. Diameter of 𝑺𝒇𝒏 :

The diameter of the graph 𝑆𝑓𝑛 is diam( 𝑆𝑓𝑛 )=4.

18
3.3.18. Non cut vertices of 𝑺𝒇𝒏 :

The graph 𝑆𝑓𝑛 has no cut vertices.

3.3.19. Block of 𝑺𝒇𝒏 :

The graph 𝑆𝑓𝑛 is a block.

3.3.20. Circuit of 𝑺𝒇𝒏 :

The special graph 𝑆𝑓𝑛 is a circuit graph. Since we can draw a closed path with no
repeated edges.

a b

Figure 7: The Sunflower special graph 𝑆𝑓5

a b
Figure 8: The Sunflower special graph 𝑆𝑓6
19
 References

Behzad, M., Chartand, G. & Lesniak, L. F., 1979. Graph and Digraphs.
California: Wodsworth.

Chartrand, G., Lesniak, L. & Zhang, P., 2016. Graphs & Digraphs. 6 ed. new
work: CRC.

Daoud, S. N. & Mohamad, K. A., 2017. The complexity of some families of cycle-
related graphs. Journal of Taibah University for Science, 11(2nd), pp. 205-228.

Dharwadker, A., 2006. The Vertex Coloring Algorithm.

http://www.dharwadker.org/vertex_coloring.

J.wilson, R., 1996. Introduction of Graph Theory. 4 ed. England: Ongman

Malaysia. (prentice hall).

Kaur, G., 2020. Applications of Graph Theory in Science and Computer.

International Journal of Advances in Engineering and Management, 2(6), pp.
737-739.

Kenneth, H., 2014. Discrete Mathematics And Its Applications. 2ed ed. New
York: A Chapman & Hall Book.

L.Gross, J., yellen, J. & Anderson, M., 2019. Graph Theory and it's Applications.
3rd ed. london: Taylor and Francis group.LLC.

Muhammed, G. A. & Ali, A. A., 2013. The Detour Polynomials of the Corona of
Graphs. Raf. J. of Comp. & Math’s, Volume 10, p. 3.

P.Dankkelmann, 1997. Average distance and the domination number. Discrete

Applied Math, Volume 80, pp. 21-35.

Prajapati, M. C., 2011. Distance in graph theory and its application. International
Journal of Advanced Engineering Technology, 2(4), pp. 147-150.

T.Reti, R. &., 2020. On the transmission-based graph topological indices.

Kragujevac Journal Of Mathematics, 44(1), pp. 41-63.

20
 ‫الخالصة‬

‫في هذا العمل نجد معدل المسافة‪ ،‬دليل االلتفاق ‪ ،‬متعددة دود االلتفاق للبيان الخاص باسم بيان عباد‬
‫)‪2(3𝑛 − 5‬‬
‫= ) 𝑛𝑓𝑆(𝜇 ل ‪𝑑𝑑(𝑆𝑓𝑛 ) = 𝑛(3𝑛2 + 2𝑛 − 1) ، 𝑛 ≥ 5‬‬ ‫الشمس 𝑛𝑓𝑆 وهي‪،‬‬
‫‪2𝑛 + 1‬‬
‫‪𝑛−1‬‬

‫‪ 𝐷(𝑆𝑓𝑛 , 𝑥) = 𝑛(𝑥 𝑛 + 𝑥 2𝑛−1 + 𝑥 2𝑛 ) + 2𝑛 (∑ 𝑥 𝑛+𝑖 ) ،‬لكل ‪𝑛 ≥ 3‬‬

‫‪𝑖=1‬‬

‫مع اعطاء بعض امثلة مثيرة ومتعلمة بالموضوع‪.‬‬

‫االضافة الى ذلك تقوم بدراسة بعض الخواص البيانية للبيان 𝑛𝑓𝑆 التلوين‪ ،‬ويجاد اقل عدد التلوين‪،‬‬
‫لحضر‪ ،‬غير اويلري‪ ،‬غير الهاملتونى‪ ،‬غير منتظم‪ ،‬مستوي‪ ،‬متصل‪ ،‬أعلى وأقل درجة لرؤوس البيان‪،‬‬
‫صفوفة التجاور و مصفوفة العقوع‪،‬مركز ‪ ،‬محيط‪ ،‬لصف قطر‪ ،‬قطر البيان‪ ،‬رؤس قاطعة قاطع و‬
‫مقاطعة‪.‬‬

‫‪a‬‬
 ‫پوختە‬

‫لەم کارەدا تێکرای دووری‪ ،‬نيشانی خوالنەوە و رادەداری خوالنەوەی لە گرافيکی تايبەتی گوڵەبەڕۆژە‬

‫)‪2(3𝑛−5‬‬
‫= ) 𝑛𝑓𝑆(𝜇 بۆ‪ 𝑑𝑑(𝑆𝑓𝑛 ) = 𝑛(3𝑛2 + 2𝑛 − 1) ، 𝑛 ≥ 5‬بۆ‬ ‫𝑛𝑓𝑆 کە بريتيە لە ‪،‬‬
‫‪2𝑛+1‬‬
‫‪𝑛−1‬‬
‫𝑛‬ ‫‪2𝑛−1‬‬ ‫) 𝑛‪2‬‬
‫𝑥 ‪ 𝐷(𝑆𝑓𝑛 , 𝑥) = 𝑛(𝑥 +‬بۆ ‪،𝑛 ≥ 3‬‬ ‫𝑥‪+‬‬ ‫‪+ 2𝑛 (∑ 𝑥 𝑛+𝑖 ) ، 𝑛 ≥ 3‬‬
‫‪𝑖=1‬‬

‫بە دوای يەکەوە بۆ دەدۆزينەوە لەگەڵ هێنانەوەی چەند نمونەيەکی سەرنج راکێش و پەيوەنديدار بە‬
‫بابەتەکانەوە‪.‬‬

‫وە هەروەها هەندێک سيفەتی ئەم گرافە تايبەتە 𝑛𝑓𝑆 باس دەکەين وەک رەنگ کردنی و دۆزينەوەی‬
‫کەمترين ژمارە بۆ رەنگ کردنی لە رەنگەکان‪ ،‬ناوقەدی گراف‪ ،‬نا ئۆيلەری‪ ،‬وێنەکێشانی ڕووتەختی‪،‬‬
‫ناڕێکی گرافەکە‪ ،‬بەيەک گەيشتووی گرافەکە‪ ،‬گەورەترين و بچوکترين پلەی سەرەکانی‪ ،‬ڕيزکراوی‬
‫تەنيشيت يەک‪ ،‬ڕيزکراوی کەوتنە سەری گرافەکە‪ ،‬نا هاميلتۆنيان‪ ،‬ناوەند‪ ،‬چێوە‪ ،‬نيوە تيرە‪ ،‬تيرە ‪،‬‬
‫بلۆک‪ ،‬پچڕێنەر و سەرە بڕەرەکان‪.‬‬

‫‪b‬‬