On Di erence Cordial Graphs and Other Graphs

Abstract

This thesis sheds light on the two concepts of types of graph labeling and describe the labeling for many families of graphs. Graph labeling is one of the famous problems in Graph Theory. Recently graph labeling became more important because the growth of its applications in many of sciences and technology on a di erent area such as: computer programming, coding theory, neural network, biotechnology, in the study of X-Ray crystallography, radar, communication network, circuit layouts. In this work by a graph G = (V;E), we mean a nite, undirected graph with neither loops nor multiple edges. For graph theoretic terminology we refer to Harary [14] and for graph labeling, Gallian [12] is referred to. In general Graph labeling is a strong communication between Number theory and structure of graphs. Nowadays nearly 200 graph labelings techniques have been studied. Throughout this work we present new results in two types of graph labelings, and discuss the labeling of many kinds of graphs in chapters 2; 3; 4 and 5. 1