Journal of Applied and Pure Mathematics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지
DOI QR코드

DOI QR Code

PAIR DIFFERENCE CORDIAL LABELING OF m-COPIES OF SOME GRAPHS

  • R., PONRAJ (Department of Mathematics, Sri Paramakalyani College) ;
  • A., GAYATHRI (Department of Mathematics, Manonmaniam Sundaranar University) ;
  • S., SOMASUNDARAM (Department of Mathematics, Manonmaniam Sundaranar University)
  • Received : 2022.08.08
  • Accepted : 2022.10.18
  • Published : 2022.11.30
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper we investigate the pair difference cordial labeling behaviour of m- copies of K4, subdivision of star, fan, comb graphs.

Keywords

Acknowledgement

The authors thank the Referee for the 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. Somasundaram, Pair difference cordiality of some snake and butterfly graphs, Journal of Algorithms and Computation 53(1), (2021), 149-163.
  6. R. Ponraj, A. Gayathri, and S. Somasundaram, 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. Somasundaram, 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. Somasundaram, Some pair difference cordial graphs, Ikonion Journal of Mathematics 3 (2021), 17-26.
  9. R. Ponraj, A. Gayathri, and S. Somasundaram, 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. Somasundaram, Pair difference cordiality of some special graphs, J. Appl. and Pure Math. 3 (2021), 263-274.
  11. R. Ponraj, A. Gayathri, and S. Somasundaram, Pair difference cordiality of mirror graph, shadow graph and splitting graph of certain graphs, Maltepe Journal of Mathematics 4 (2022), 24-32. https://doi.org/10.47087/mjm.1089672
  12. R. Ponraj, J.V.X. Parthipan, Pair sum labeling of graphs, J. Indian Acad. Math. 32 (2010), 587-595.
  13. R. Ponraj, S. Sathish narayanan, and R. Kala, Difference cordial labeling of graphs, Global J. Math. Sciences:Theory and Practical 3 (2013), 192-201.
  14. U.M. Prajapati, K.K. Raval, Product cordial labeling in context of some graph operations on Gear graph, Open. Journal of Disc. Math. 6 (2016), 259-267. https://doi.org/10.4236/ojdm.2016.64022
  15. U.M. Prajapati, N.B. Patel, Edge Product cordial labeling of some cycle related graphs, Open. Journal of Disc. Math. 6 (2016), 268-279. https://doi.org/10.4236/ojdm.2016.64023
  16. U.M. Prajapati, N.B. Patel, Edge Product cordial labeling of some graphs, Journal of Appl. Math and comput. Mech. 18 (2019), 69-76.
  17. U.M. Prajapati, A.V. Vantiya, SD Prime cordial labeling of some snake graphs, Journal of Appl. Math and comput. Sci. 6 (2019), 1857-1868.
  18. A. Rosa, On certain Valuations of the vertices of a graph, Theory of graphs, International Symposium, Rome. July, (1967) 349-345.