Edge Irregularity Strength of Some Path Related Graphs

Abstract

Edge Irregularity Strength of Some Path RelatedGraphs Graph theory is playing a key role in applied and pure mathematics. The scope of graph theory is expanding day by day. In graph theory, there are many categories of graph labeling, such as, graceful label ing, cordial labeling, magic labeling and irregular labeling. Graph labeling is being used in different fields, such as, computer networking, coding theory, circuit design and data management. In this thesis, we will try to find irregular labeling of some path related graphs. Mythesis comprising of six chapters. In the first chapter we will define some funda mental definitions. In the 2nd chapter, we will discuss various types of graph labelings, such as, edge and vertex labeling, total labeling, irregular labeling, edge irregular labeling, vertex irregular labeling and irregularity strength. In the 3rd chapter, we will find vertex irregular labeling and evaluate edge irregularity strength of triangular snake graph, alternate triangular snake graph. In and 4th chapter, we will find vertex irregular labeling and evaluate edge irregularity strength of different variations of comb graph. Results regarding edge irregularity strength and some relevant references are given in the 5th and 6th chapters respectively