DOI QR코드

DOI QR Code

PAIR DIFFERENCE CORDIAL NUMBER OF A GRAPH

  • R. PONRAJ (Department of Mathematics, Sri Paramakalyani College) ;
  • A. GAYATHRI (Department of Mathematics, Sri Paramakalyani College)
  • Received : 2024.01.24
  • Accepted : 2024.06.07
  • Published : 2024.07.30

Abstract

Let G be a (p, q) graph. Pair difference cordial number of a graph G is the least positive integer m such that G∪mK2 is pair difference cordial. It is denoted by PDC𝜂(G). In this paper we find the pair difference cordial number of bistar, complete, helm, star, wheel.

Keywords

Acknowledgement

The authors thank the Referee for their valuable suggestions towards the improvement of the paper.

References

  1. I. Cahit, Cordial Graphs A weaker version of Graceful and Harmonious graphs, Ars combin. 23 (1987), 201-207.
  2. J.A. Gallian, A Dynamic survey of graph labeling, The Electronic Journal of Combinatorics 19 (2016).
  3. F. Harary, Graph theory, Addision wesley, New Delhi, 1969.
  4. R. Ponraj, A. Gayathri, and S. Soma Sundaram, Pair difference cordial labeling of graphs, J. Math. Comp. Sci. 11 (2021), 2551-2567.
  5. R. Ponraj, A. Gayathri, and S. Soma Sundaram, Pair difference cordiality of some snake and butterfly graphs, Journal of Algorithms and Computation 53 (2021), 149-163.
  6. R. Ponraj, A. Gayathri, and S. Soma Sundaram, Pair difference cordial graphs obtained from the wheels and the paths, J. Appl. and Pure Math. 3 (2021), 97-114.
  7. R. Ponraj, A. Gayathri, and S. Soma Sundaram, Pair difference cordiality of some graphs derived from ladder graph, J. Math. Comp. Sci. 11 (2021), 6105-6124.
  8. R. Ponraj, A. Gayathri, and S. Soma Sundaram, Some pair difference cordial graphs, Ikonion Journal of Mathematics 3 (2021), 17-26.
  9. R. Ponraj, A. Gayathri, and S. Soma Sundaram, Pair difference cordial labeling of planar grid and mangolian tent, Journal of Algorithms and Computation 53 (2021), 47-56.
  10. R. Ponraj, A. Gayathri, and S. Soma Sundaram, Pair difference cordiality of some special graphs, J. Appl. and Pure Math. 3 (2021), 263-274.
  11. M.A. Seoud, M.S. Salman, On Difference cordial graphs, Mathematica Aeterna 5 (2015), 189-199.
  12. M.A. Seoud, M.S. Salman, Some results and examples on difference cordial graphs, Turkish Journal of Mathematics 40 (2016), 417-427. https://doi.org/10.3906/mat-1504-95