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 K_1,n, K_1,1,n,_1,n: n>, K_1,2nXK₂,K₃*K_2,n, K₄*K_2,n are Relaxed Cordial Graphs.