Konu "Graceful labeling" için listeleme
Toplam kayıt 3, listelenen: 1-3
-
Even vertex odd mean labeling of transformed trees
(Işık University Press, 2020)Let G = (V;E) be a graph with p vertices and q edges. A graph G is said have an even vertex odd mean labeling if there exists a function f: V (G) →{0; 2; 4;:::; 2q} satisfying f is 1-1 and the induced map f*: E(G) → {1; ... -
On (a; d)-eat labeling of subdivision of trees
(Işık University Press, 2020-04-07)An (a, d)-edge antimagic total (EAT) labeling on a graph Γ with p vertices and q edges is a one-to-one function ψ from V (Γ)∪E(Γ) onto the set of integers 1, 2, ...p+q with the property that for each edge uv, the set {ψ(u) ... -
Some new classes of graceful diameter six trees
(Işık University Press, 2015)Here we denote a diameter six tree by (a0; a1, a2, . . . , am; b1, b2, . . . , bn; c1, c2, . . . , cr), where a0 is the center of the tree; ai, i = 1, 2, . . . , m, bj , j = 1, 2, . . . , n, and ck, k = 1, 2, . . . , r are ...