EQUIVALENCIES OF CORDIAL LABELING AND SUM DIVISOR CORDIAL LABELING

Print ISSN: 0972-7752 | Online ISSN: 2582-0850 | Total Downloads : 192

Volume : 16 , Issue : 2
DOI:
Author :
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)

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 graph, graceful graph, cordial graph, tree.

A.M.S. subject classification

05C78.

.....

Download PDF 192 Click here to Subscribe now