1 publication
-
Published Subscription
Subtract Divisor Cordial Labeling of Ring Sum of a GraphsBy A H Rokad
Abstract: Abstract: A subtract divisor cordial labeling of a graph G with vertex set is a bijection f from V to {1, 2,…, |V|} such that an edge is assigned the label 1 if 2 divides (f(u) – f(v)) and 0 otherwise, then number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a subtract divisor cordial labeling is …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 6, Issue 3, 2019 · pp. 23–28 Read article →