Cordial Labeling of Generalized Jahangir Graph
![](https://ojsdergi.com/ojsicons/gor.png)
![](https://ojsdergi.com/ojsicons/pdf.png)
Keywords:
Graph Labeling, Cordial Labeling, Generalized Jahangir graphAbstract
In this paper we have proved that the Generalized Jahangir graph $J_{m,n}$ is cordial for all $m\geqslant 1$ and $n\geqslant 3$, except $J_{1,4n-1}$ for all $n\geqslant 1$.
Downloads
Published
How to Cite
Issue
Section
License
![Creative Commons License](http://i.creativecommons.org/l/by-nc/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.