الفهرس 
Chapter one : Basic Concepts Of Graph TheoryOnly 14 pages are availabe for public view
 |  | from | 85 |  |  |
| | | from | 85 | | |
Abstract
SUMMARY
The project of this thesis is based on a field of mathematics called graph theory.
The thesis consists of four chapters:
Chapter one : Basic Concepts Of Graph Theory
It’s an introduction for the following chapters and contains some of main concepts
of graph theory ; also illustrates concept of cordial labeling and corona.
Chapter two: Corona Between Paths And Cycles
We investigated the cordiality of the corona between paths Pn and cyclesCm, namely
Pn ʘCm ,started with cycles having three vertices, we showed that the corona Pn ʘCm is
cordial if and only if (m,n) ≠(1,3(mod4)) . This target achieved through five Lemmas
each one consists of four cases, each case being illustrated by different examples.
The results of this chapter are accepted for publications in Journal ARS Combinatoria
in Canada September 9 2015.
Chapter three: Corona Between Cycles And Paths
We investigated the cordiality of the corona between cycles and Paths Pm .We
showed that G1ʘ G2 is not in general isomorphic to G1ʘ G2 .This target achieved
through three Lemmas; each one consists of different cases, also as in chapter two each
case illustrated by different examples.
The results of this chapter are accepted for publications in Journal Mitteilungen
Klosterneuburg in Austria February 2 2016.
Chapter four: Kite Graphs Cordiality
We discussed kite graphs; formed from a cycle Cm and a path Pn , we proved that all
kite graph types are cordial.
Started with cycles having three vertices, We showed that any kite graph is cordial
m 3 & n 1 this target achieved through series of lemmas each of different cases
illustrated by examples.Finally, applications discussed also in this chapter