Open AccessDifference cordial labeling and strongly multiplicative labeling for some extended duplicate graph
Author(s) -
R. Avudainayaki,
Balaji Selvam,
P. P. Ulaganathan
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1377/1/012005
Subject(s) - multiplicative function , graph , arrow , edge graceful labeling , combinatorics , labelling , graph labeling , mathematics , computer science , line graph , voltage graph , chemistry , graph power , programming language , biochemistry , mathematical analysis
The aim of this paper is to prove that the extended duplicate graph of arrow graph and splitting graph of path admits difference cordial labeling and strongly multiplicative labelling.