IJPAM: Volume 106, No. 8 (2016)

CORDIAL LABELING OF MONGOLIAN TENT $M_{n}$

Sharmila Mary Arul$^1$, K. Subashini$^2$
$^{1,2}$Department of Mathematics
Jeppiaar Engineering College
Chennai, INDIA


Abstract. The Cordial labeling of graph $G$ is an injection $f:V(G)\rightarrow\{0,1\}$ such that each edge $uv$ in $G$ is assigned the label $\vert f(u)-f(v)\vert$ with the property that $\vert v_{f}(0)-v_{f}(1)\vert\leq1$ and $\vert e_{f}(0)-e_{f}(1)\vert\leq1$, where $v_{f}(i)$ for $i=0,1$ denote the number of vertices with label $i$. The graph which admits cordial labeling is called the Cordial graph. In this paper, we prove that the Mongolian Tent is cordial.

Received: February 15, 2016

AMS Subject Classification: 05C78

Key Words and Phrases: cordial labeling, Mongolian Tent

Download paper from here.



DOI: 10.12732/ijpam.v106i8.1 How to cite this paper?

Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2016
Volume: 106
Issue: 8
Pages: 1 - 6


$M_{n}$%22&as_occt=any&as_epq=&as_oq=&as_eq=&as_publication=&as_ylo=&as_yhi=&as_sdtAAP=1&as_sdtp=1" title="Click to search Google Scholar for this entry" rel="nofollow">Google Scholar; DOI (International DOI Foundation); WorldCAT.

CC BY This work is licensed under the Creative Commons Attribution International License (CC BY).