Open Access
Research Article·pp. 665–674·Vol. 27, Issue 2-BMar 2024
Burning, edge burning & chromatic burning classification of some graph family
S. Komala, U. Mary
Published Online: 11 Apr 2024DOI: 10.47974/JDMSC-1911
In this paper: 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 grap...
