EQUIVALENCIES OF CORDIAL LABELING AND SUM DIVISOR CORDIAL LABELING

Print ISSN: 0972-7752 | Online ISSN: 2582-0850

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 Click here to Subscribe now