Volume : III, Issue : VII, July - 2014

ON CORDIAL GRAPHS

A. Nellai Murugan, A. Meenakshi Sundari

Abstract :

A cordial labeling of a graph G with vertex set V is a bijection from V to {0,1} such that if each edge uv is assigned the label |f(u)−f(v)| the number of vertices labeled with 0 and the number of vertices labeled with 1 differ by atmost 1and the number of edges labeled with 0 and the number of edges labeled with 1 differ by atmost 1.A graph which cordial admits cordial labeling is the cordial graph.

A Resideo cordial labeling of a graph G with vertex set V is a bijection from V to {0,1} such that if each edge uv is assigned the label (f(u)+f(v))(mod 2) the number of vertices labeled with 0 and the number of vertices labeled with 1 differ by atmost 1and the number of edges labeled with 0 and the number of edges labeled with 1 differ by atmost 1.A graph which admits Resideo cordial labeling is the Resideo cordial graph. In this paper, it is proved that every shadow graph is a cordial graph and that every shadow graph is a Resideo cordial graph

Keywords :

Article: Download PDF   DOI : 10.36106/ijsr  

Cite This Article:

A.NELLAI MURUGAN, A. MEENAKSHI SUNDARI ON CORDIAL GRAPHS International Journal of Scientific Research, Vol : 3, Issue : 7 July 2014

Number of Downloads : 1189

References :