VARIOUS GRAPH LABELING TECHNIQUES FOR THE LINE GRAPH OF BISTAR
Keywords:
Line Graph, Bistar, Cordial Labeling. 2010 Mathematics Subject Classification: 05C78Abstract
The line graph ( ) of a graph is the graph whose vertex set is edge set of and two vertices are adjacent in ( ) whenever they are incident in . In this paper an investigation on the line graph of bistar for cordial labeling, product cordial labeling, total product cordial labeling, edge product cordial labeling and total edge product cordial labeling has been done.