Konu "Ladder graphs" için listeleme
Toplam kayıt 2, listelenen: 1-2
-
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)|, ... -
On edge irregularity strength of ladder related graphs
(Işık University Press, 2024-04)For a simple graph G, a vertex labeling ? : V (G) ? {1, 2, . . . , k} is called k-labeling. The weight of an edge xy in G, written w?(xy), is the sum of the labels of end vertices x and y, i.e., w?(xy) = ?(x) + ?(y). A ...
