Volume : IV, Issue : III, March - 2014

Cordial Labeling of Path Related Splitted Graphs

Dr. A. Nellai Murugan, Miss. G. Baby Suganya

Abstract :

Let G = (V, E ) be a graph with p vertices and q edges and let f : V (G) → { 0,1 } be a map. The graph G is said to have a cordial labeling if for the edge e = uv, the induced edge labeling f *: E (G) → { 0,1 } is given by f*(e)=|f(u)-f(v)|. Let vf (0), vf (1) be the number of vertices of G having labels 0 and 1 respectively under f and ef (0) , ef (1)be the number of edges having labels 0 and 1 respectively. A binary vertex labeling of a vertex G is called a cordial labeling if | vf (0) - vf (1) | ≤ 1 and | ef (0) - ef (1) | ≤ 1. A graph G is cordial if it admits cordial labeling. In this paper, it is proved that S(Sp(Pn, K1,m)) : (n - odd) , S(Sp(Pn, K1,m)) : (n - even) , S(Pn @ K1,m ) : (n-odd), S(Pn @ K1,m ) : (n-even), S(Pn + K1 ) are cordial graphs.

Keywords :

Article: Download PDF   DOI : 10.36106/ijar  

Cite This Article:

Dr. A.NELLAI MURUGAN, Miss. G.BABY SUGANYA Cordial Labeling of Path Related Splitted Graphs Indian Journal of Applied Research, Vol.IV, Issue. III

Number of Downloads : 746

References :