Search In this Thesis
   Search In this Thesis  
العنوان
On Difference Cordial Graphs and
Other Graphs /
المؤلف
Al-Azzawy,Shakir Mahmoud Salman.
هيئة الاعداد
باحث / Shakir Mahmoud Salman Al-Azzawy
مشرف / Mohammed Abdel Azim Seoud
مشرف / Labib Rashed El-Sayed Awad
تاريخ النشر
2016
عدد الصفحات
142p.;
اللغة
الإنجليزية
الدرجة
الدكتوراه
التخصص
الرياضيات
تاريخ الإجازة
1/1/2016
مكان الإجازة
جامعة عين شمس - كلية العلوم - الرياضيات البحتة
الفهرس
Only 14 pages are availabe for public view

from 142

from 142

Abstract

Graph labeling is one of the important branches of Graph Theory and
became a principal tool in many applications on different sciences and
technologies. All that leads to appearance of more than one type of
labeling and multiple techniques to meet the required purposes.
In this thesis we study the two main types of graph labeling and
introduce the labelings for interested families of graphs and a tractive
results for graphs of these types. We state some basic definitions and
theorems in graph theory which we need. We divide the other work into
four chapters:
In chapter two we introduce some results in difference cordial graphs
and difference cordial labelings for some families of graphs such as: ladder,
triangular ladder, grid, step ladder and two sided step ladder graph. Also
we discussed some families of graphs which may be difference cordial or
not, such as diagonal ladder and some types of one-point union of graphs.
In chapter three we introduce some results on difference cordial graphs,
where we present results concerning the relation between difference
cordiality and the lengths of paths on graphs and study the SemiHamiltonian graph, biconnected outerplanar graphs and the line graph of
vii
a graph. Also, we describe the difference cordial labeling for some families
of graphs such as: the graph obtained by duplication a vertex by an edge,
bow graphs, butterfly graphs, shell-flower graphs and one-point union of
complete graphs.
In chapter four we introduce some results on divisor cordial graphs and
describe the divisor cordial labeling for the families of graphs: the jelly
fish graph, the shell, the bow graph, butterfly graphs and the friendship
graphs. In the last chapter we introduce results in divisor cordial labeling
for regular graphs, divisor labelings for all graphs with number of vertices
less than eight, and divisor cordial labelings for some types of trees such
as: olive trees, spider trees, m−star trees, k−distant trees, caterpillar
trees and banana trees.