Search In this Thesis
   Search In this Thesis  
العنوان
Cordial Labeling of Third Power Of Some Graphs /
المؤلف
Afify, Maha Abdallah Elsaid.
هيئة الاعداد
باحث / مها عبد الله السيد محمد عفيفي
مشرف / شكري ابراهيم ندا
مناقش / عبد المنعم محمد قوزع
مناقش / عاطف ابراهيم رمضان عجور
الموضوع
Mathematics.
تاريخ النشر
2023.
عدد الصفحات
85 p. :
اللغة
الإنجليزية
الدرجة
ماجستير
التخصص
الرياضيات
تاريخ الإجازة
28/9/2022
مكان الإجازة
جامعة المنوفية - كلية العلوم - الرياضيات
الفهرس
Only 14 pages are availabe for public view

from 85

from 85

Abstract

The thesis is related to one of the mathematics branches called graph theory specially cordial labeling theory
It consists of 5 chapter.
Chapter one: The basic concepts:
It warms up for other branches and includes some basic concepts which are related to graph theory as it explains labeling and cordial labeling
Chapter two:The cordial labeling of third power of lemniscate graph:
In this chapter we have discussed labeling of the third power of lemniscate graphs consisting two cycles both of them from the third powerand the two cycles have a common vertex.
It has been proved that all kinds of the third power of lemniscate graphs are cordial except lemniscate belongs to Euler.
We have got the necessary and sufficient conditions for the third power of lemniscate graph to be cordial graph.
The results of this chapter presented in the fifth scientific conference for young researchers held in Sohag univeristy on feb 2020.
Chapter three: The cordial labeling of third power of cone graph:
In this chapter I have discussed labeling of the third power of cone graphs. It has been proved that all kinds of the third power of cone graphs are cordial.
We have discussed the necessary and sufficient conditions for the third power of cone graph to be cordial graph.
The result of this chapter published in italian journal of pure and applied mathematics.
Chapter four: The cordial labeling of corona product between paths and the third power of lemniscate graphs.
In this chapter we have discussed labeling of corona product between paths and the third power of lemniscate graphs and proved cordiality through many stages, we have started by studying cordial labeling on corona product between paths and third power of lemniscate graphs for the cycle with three vertices. Then we studied it in general case. Finally we have expaained the necessary and sufficient condition for cordial labeling.The result of this chapter accepted in Global journal of pure and applied mathematics.
Chapter five: The cordial labeling of corona product between cycles and the third power of lemniscate graphs.
In this chapter we have discussed labeling of corona product between cycles and the third power of lemniscate graphs and proved cordiality through many stages. By studying cordial labeling on corona product between cycles and third power of lemniscate graphs in case cycle with three vertices. Then we have studied it in general case. Finally we have explained the necessary and sufficient condition of cordial labeling. The result of this chapter accepted in journal of pure mathematics.