Volume : V, Issue : V, May - 2016
Homo Cordial Graphs
Selvam Avadayappan, M. Bhuvaneshwari, M. Vasanthi
Abstract :
Let G=(V,E) be a graph with p vertices and q edges. Let f be a mapping from V to {0,1}. The induced edge label of an edge uv is 1 if f(u) = f(v) or 0 if f(u)≠f(v). Then f is called a homo cordial labeling if the number of vertices labeled with 0 and the number of vertices labeled with 1 differ by at most 1 and the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. The graph that admits a homo cordial labeling is called a homo cordial graph. In this paper, we prove that some standard trees, corona related graphs are homo cordial.
Keywords :
Article:
Download PDF
DOI : 10.36106/ijsr
Cite This Article:
Selvam Avadayappan, M.Bhuvaneshwari, M.Vasanthi Homo Cordial Graphs International Journal of Scientific Research, Vol : 5, Issue :
5 MAY 2016
Number of Downloads : 919
References :
Selvam Avadayappan, M.Bhuvaneshwari, M.Vasanthi Homo Cordial Graphs International Journal of Scientific Research, Vol : 5, Issue : 5 MAY 2016
Our Other Journals...
-
Indian Journal of
Applied Research Visit Website -
PARIPEX Indian Journal
of Research Visit Website -
Global Journal for
Research Analysis Visit Website