Künye "Laavanya, D. & Yamini, S. D. (2024). Graceful coloring of ladder graphs. TWMS Journal of Applied and Engineering Mathematics, 14(3), 991-1001." JAEM 2024, Vol 14, No 3 için listeleme
Toplam kayıt 1, listelenen: 1-1
-
Graceful coloring of ladder graphs
(Işık University Press, 2024-07)A graceful k-coloring of a non-empty graph G = (V, E) is a proper vertex coloring f : V (G) → {1, 2, ..., k}, k ≥ 2, which induces a proper edge coloring f*: E(G) → {1, 2, ..., k − 1} defined by f*(uv) = |f(u) − f(v)|, ...