Burning, edge burning & chromatic burning classification of some graph family

Abstract

Graph ‘G’ is a Simple and undirected graph, which has a lowest number of color that is required to color the edge is called chromatic index. It is denoted by the symbol χ1(G). In order to burn a graph, a minimum source of edges is required which is called edge burning index or edge burning number and it is denoted by the symbol b1(G). A minimum cardinality of color graph set and the source of the burning index set are called edge chromatic burning and let us assume that it is represented by the symbol χb1(G). In this paper we are mainly concentrating on identifying the chromatic burning and edge chromatic burning graphs and their chromatic burning index using a specific graph family. They are Petersen graph, Helm graph and n- Sunlet graph.