Difference Cordial Labeling of 2-tuple Graphs of Some Graphs


Abstract views: 21 / PDF downloads: 18

Authors

  • P. L. Vihol Department of Mathematics, Government Engineering College, Rajkot, Gujarat, India
  • P. H. Shah Department of Mathematics, L.E Polytechnic College, Morbi, Gujarat, India

Keywords:

Triangular snake, Quadrilateral snake, Crown, Ladder, Wheel, Path, Cycle

Abstract

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.

 

 

Author Biographies

P. L. Vihol, Department of Mathematics, Government Engineering College, Rajkot, Gujarat, India

 

 

P. H. Shah, Department of Mathematics, L.E Polytechnic College, Morbi, Gujarat, India

 

 

Downloads

Published

01-05-2016

How to Cite

P. L. Vihol, & P. H. Shah. (2016). Difference Cordial Labeling of 2-tuple Graphs of Some Graphs. International Journal of Mathematics And Its Applications, 4(2 - A), 111–119. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/1013

Issue

Vol. 4 No. 2 - A (2016)

Section

Research Article

License

Copyright (c) 2023 International Journal of Mathematics And its Applications

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.