International Journal of Multidisciplinary Research and Development

International Journal of Multidisciplinary Research and Development


International Journal of Multidisciplinary Research and Development
International Journal of Multidisciplinary Research and Development
Vol. 2, Issue 10 (2015)

Tree Related Relaxed Cordial Graphs


A. Nellai Murugan, R. Megala

Let G = (V,E) be a graph with p vertices and q edges. A Relaxed Cordial Labeling of a Graph G with vertex set V is a bijection from V to {-1, 0, 1} such that each edge uv is assigned the label 1if |f (u) + f (v) | = 1or 0 if | f (u) + f (v) | = 0 with the condition that the number of edges labeled with 0 and the number of edges labeled with 1 differ by atmost 1. The graph that admits a Relaxed Cordial Labeling (RCL) is called Relaxed Cordial Graph (RCG). In this paper, we proved that tree related graphs Star K1,n, K1,1,n,1,n: n>, K1,2nXK2,K3*K2,n, K4*K2,n are Relaxed Cordial Graphs. 
Download  |  Pages : 80-83
How to cite this article:
A. Nellai Murugan, R. Megala. Tree Related Relaxed Cordial Graphs. International Journal of Multidisciplinary Research and Development, Volume 2, Issue 10, 2015, Pages 80-83
International Journal of Multidisciplinary Research and Development