Cordial Labelings of 𝐵𝑛 and Linear Phenylene Graphs

Abstract

Cordial Labelings of Bn and Linear phenylene Graphs Graph theory is one of the important branch of mathematics. Mathematicians consider it useful in light of the fact that it has wide range of applications in different areas such as in computer science, sociology, engineering, communication networks, radar tracking and much more see [2, 3, 13].It has risen as the most important branch of mathematics. In graph theory there are different types of labeling. In this thesis our work is focused on cordial labelings of Bn graph and linear phenylene graph. First chapter includes introduction. In this chapter we basically discussed the basic definitions related to the graph and studied different types of graphs including Bn graph and linear phenylene graph. In second chapter we shed light on various types of labelings introduced by renowned scholars. We have discussed cordial labelings and its several types. In third chapter we have discussed some results for cordial labeling of Bn graph and linear phenylene graph. In chapter four we find the results for edge product cordial labeling of Bn graph and linear phenylene graph. In chapter five we find the results for total edge product cordial labeling of Bn graph and linear phenylene graph