Near Mean Cordial - Path Related Graphs |
Author(s): |
| Dr A. Nellai Murugan , Department of Mathematics,V.O.Chidambaram College, Tuticorin 628008,INDIA; L. Pandiselvi, PG and Research Department of Mathematics, V. O. Chidambaram College, Tuticorin-628008,; S. Navaneethakrishnan, PG and Research Department of Mathematics, V. O. Chidambaram College, Tuticorin-628008, |
Keywords: |
| Cordial Labeling, Mean Cordial Labeling, Near Mean Cordial Labeling and Near Mean Cordial Graphs |
Abstract |
|
Let G = (V,E) be a simple graph. A Near Mean Cordial Labeling of G is a function f : V(G) -> {1,2,3,...,p-1,p+1} such that for each edge uv the induced map f* defined by f*(uv) ={( 1 if(f(u)+f(v)=0 (mod2)@0 else)-|, and it satisfies the condition |e_f(0)- e_f(1)|<= 1,wheree_f(0) and e_f(1) represent the number of edges labeled with 0 and 1 respectively. A graph is called a Near Mean Cordial Graph if it admits a Near Mean Cordial Labeling. In this paper, It is proved that the graphsP_n, SP (P_n,K_(1,m)) and B_(m,n)are Near Mean Cordial Graphs. AMS Mathematics subject classification 2010: 05C78. |
Other Details |
|
Paper ID: IJSRDV4I80064 Published in: Volume : 4, Issue : 8 Publication Date: 01/11/2016 Page(s): 62-64 |
Article Preview |
|
|
|
|
