Abstract: A graph is defined as set of all vertices and edges. A mapping f from to is called mean cordial labelling if for each edge assign the label such that and where . If the graph is mean cordial then it is called mean cordial graph. In this paper we intend to study on the joins of Bi Star graph and prove that they are mean cordial graph. Further we study some properties of joins of Bi Star graph.
Keywords: Bi Star graph, Mean cordial labelling, Mean Cordial graph, Joins of Bi Star graph.
Title: A Different Approach in Studying Mean Cordial Labeling of Joins of Bi Star graph
Author: S.Sriram, Dr.R.Govindarajan
International Journal of Interdisciplinary Research and Innovations
ISSN 2348-1218 (print), ISSN 2348-1226 (online)
Research Publish Journals
