Graph labeling serves as an important bridge between discrete mathematics and network structures. An injective vertex labeling f: V(G) to {0, 1, ..., 2q-1} is called an odd harmonious labeling if the induced edge labeling f^*(uv) = f(u) + f(v) forms a bijection onto the set of the first q positive odd integers {1, 3, ..., 2q-1}. Utilizing the bipartite 2-coloring of K_{2,n}, we conveniently assign even labels to central hub vertices and odd labels to leaf vertices as a constructive choice, noting that swapping the parities of the two bipartition sets also yields a valid labeling. In this paper, we investigate the odd harmonious labeling of two classes of K_{2,n}-snake graphs: Type 1 (S_1(m,n)), formed by sequentially identifying blocks via degree-2 boundary leaf vertices, and Type 2 (S_2(m,n)), formed by identifying blocks via central hub vertex (of degree n) vertices. This paper establishes that Type 1 K_{2,n}-snake graphs S_1(m,n) are odd harmonious for all m ge 1, n ge 2, and Type 2 K_{2,n}-snake graphs S_2(m,n) are odd harmonious for all m ge 1, n ge 1. Notably, the special case n = 2 corresponds to the classical C_4-snake graphs previously studied by Alyani et al., while the results for n ge 3 represent novel extensions to the broader family of K_{2,n}-snake graphs. Explicit, unified vertex labeling functions and rigorous proofs of edge bijections are provided for both interconnection schemes.
Copyrights © 2026