Difference Cordial Labeling of 2-tuple Graphs of Some Graphs
![](https://ojsdergi.com/ojsicons/gor.png)
![](https://ojsdergi.com/ojsicons/pdf.png)
Keywords:
Triangular snake, Quadrilateral snake, Crown, Ladder, Wheel, Path, CycleAbstract
In this paper, we introduce new notion called 2-tuple graph of an undirected simple graph and we investigate the difference cordiality of 2-tuple graphs of Crown $Cr_n$, Wheel $W_n$, Ladder graph ${P_n} \times {P_2}$, Triangular snake $T_{n}$, Quadrilateral snake $Q_{n}$,Middle graph of path $P_{n}$ and cycle $C_n$ etc.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 International Journal of Mathematics And its Applications
![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.