EQUIVALENCIES OF CORDIAL LABELING AND SUM DIVISOR CORDIAL LABELING

H M Makadia; V J Kaneria; M J Khoda

H M Makadia Department of Mathematics, Lukhdhirji Engineering College, Morbi - 363642, Gujrat, INDIA

V J Kaneria Department of Mathematics, Saurashtra University, Rajkot - 360005, Gujrat, INDIA

M J Khoda Sarvodaya Secondary School, 250 feet ring road, Rajkot - 360004, Gujrat, INDIA

Volume 16, Issue 2 Pages 281-288 August 30, 2020 266 downloads

Article overview

Abstract

In this paper, it has been proved that every tree T is SDC (Sum divisor cordial), every graceful graph with certain condition is SDC and the cordial labeling, sum divisor cordial labeling for a graph G are equivalent.

Keywords and Phrases

Sum divisor cordial graphgraceful graphcordial graphtree.

AMS Subject Classification

05C78.

Reference information

How to Cite

H M Makadia, V J Kaneria, M J Khoda (2020). EQUIVALENCIES OF CORDIAL LABELING AND SUM DIVISOR CORDIAL LABELING. South East Asian Journal of Mathematics and Mathematical Sciences, 16(2), 281-288.

Back to this issue