Signed Product Cordial and Even Sum Cordial Labeling for the Extended Duplicate Graph of Splitting Graph of Path


Abstract views: 65 / PDF downloads: 52

Authors

  • R. Avudainayaki Department of Mathematics, Sri Sairam Institute of Technology, Chennai, India
  • B. Selvam Department of Mathematics, S.I.V.E.T. College, Gowrivakkam, Chennai, India
  • P. P. Ulaganathan Department of Mathematics, S.I.V.E.T. College, Gowrivakkam, Chennai, India

Keywords:

Graph labeling, Duplicate graph, Splitting graph, Signed product cordial, Even sum cordial

Abstract

In this paper, we prove that the extended duplicate graph of splitting graph of path admits signed product cordial, total signed product cordial and even sum cordial labeling.

Downloads

Published

15-02-2017

How to Cite

R. Avudainayaki, B. Selvam, & P. P. Ulaganathan. (2017). Signed Product Cordial and Even Sum Cordial Labeling for the Extended Duplicate Graph of Splitting Graph of Path. International Journal of Mathematics And Its Applications, 5(1 - B), 123–128. Retrieved from https://ijmaa.in/index.php/ijmaa/article/view/760

Issue

Vol. 5 No. 1 - B (2017)

Section

Research Article

License

Creative Commons License

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