A fuzzy divisor cordial labeling of a fuzzy simple graph G = (σ,µ) be a bijection σ from V to [0,1] such that if each edge μυ is assigned the label d if either σ(u) | σ(v) or σ(v) | σ(v) where d ∈ (0,1), and the label 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with d differ by at most 1. If a graph has a fuzzy divisor cordial labeling, then it is called fuzzy divisor cordial graph. In this paper, we proved that path, cycle, wheel graph, star graph, some complete bipartite graphs, shell graph S_n,S(K_(1,n)) graph, graph and the Helm H_n graph are fuzzy divisor cordial graph.
Show abstract
Full Text
