%0 Journal Article
%T Zero-M-Cordial Labeling of Some Graphs
%A Freeda Selvanayagom
%A Robinson S. Chellathurai
%J Applied Mathematics
%P 1648-1654
%@ 2152-7393
%D 2012
%I Scientific Research Publishing
%R 10.4236/am.2012.311228
%X In this paper we prove that the complete bipartite graph <i>k<sub>mn</sub></i> where m and n are even, join of two cycle graphs <i>c<sub>n</sub></i> and <i>c<sub>m</sub></i> where <i>n</i> + <i>m</i> ¡Ô 0 (mod 4), split graph of <i>c<sub>n</sub></i> for even ¡°<i>n</i>¡±, <i>K<sub>n</sub></i> ¡Á <i>P</i><sub>2</sub> where <em>n</em> is even are admits a Zero-M-Cordial labeling. Further we prove that <i>K<sub>n</sub></i> ¡Á <i>P</i><sub>2</sub><i>B<sub>n</sub></i> = <i>K</i><sub>1,<i>n</i></sub> ¡Á <i>P</i><sub>2</sub> of odd <i>n</i> admits a Zero-M-Cordial labeling.
%K Zero-M-Cordial Labeling
%K Split Graphs
%K Cartesian Product
%K H-Cordial
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=24510