Ara
Toplam kayıt 1, listelenen: 1-1
Divisor cordial labeling in the context of join and barycentric subdivision
(Işık University Press, 2019)
A divisor cordial labeling of a graph G with vertex set V (G) is a bijection f from V (G) to {1,2,...,|V(G)|} such that an edge e = uv is assigned the label 1 if f(u)|f(v) or f(v)|f(u) and the label 0 otherwise, then |e f ...