8Product Cordial Labeling for the Line Graph of Bistar

M I Bosmia

Department of Mathematics,Government Engineering College,Gandhinagar, Gujarat (INDIA)E-mail: cosmicmohit@gmail.com

Kailas K. Kanani

Department of Mathematics,Government Engineering College,Rajkot, Gujarat (INDIA)E-mail: kananikkk@yahoo.co.in

The line graph L(G) of a graph G is the graph whose vertex set is the edge set of G and two vertices are adjacent in L(G) whenever they are incident in G. In this chapter an investigation of the line graph of bistars Bn,n+1 and Bn,n+2 for product cordial labeling has been done.

8.1Introduction

In this chapter, all graphs under consideration are finite, connected, undirected and simple G = (V(G), E(G)) of order |V(G)| and size |E(G)|. For ...

Get Recent Advancements in Graph Theory now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.