Konu "Bistar" için listeleme
Toplam kayıt 2, listelenen: 1-2
-
Pair difference cordial labeling of some union of graphs
(Işık University Press, 2023-07)Let G = (V, E) be a (p, q) graph. Define ρ = {p/2 if p is even p−1/2 if p is odd and L = {±1, ±2, ±3, · · · , ±ρ} called the set of labels. Consider a mapping f : V → L by assigning different labels in L to the different ... -
Sum divisor cordial labeling in the context of graphs operations on bistar
(Işık University Press, 2022)A sum divisor cordial labeling of a graph G with vertex set V (G) is a bijection f : V (G) → {1, 2, 3, . . . , |V (G)|} such that an edge e = uv is assigned the label 1 if2|[f(u)+f(v)] and 0 otherwise, then the number of ...