Journal of Mathematics and Scientific Computing With Applications
Vol. 7 No. 1 (2026)

ODD HARMONIOUS LABELING OF TWO CLASSES OF K2,n SNAKE GRAPHS

Richard Albert Naution (Department of Mathematics, Universitas Sumatera Utara, Medan, Indonesia)
Saib Suwilo (Department of Mathematics, Universitas Sumatera Utara, Medan, Indonesia)
Mardiningsih (Department of Mathematics, Universitas Sumatera Utara, Medan, Indonesia)



Article Info

Publish Date
30 Oct 2026

Abstract

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






Journal Info

Abbrev

jmscowa

Publisher

Subject

Mathematics

Description

Journal of Mathematics and Scientific Computing With Applications is a broad-based journal covering all branches of computational or applied mathematics with special encouragement to researchers in theoretical computer science and mathematical computing. It covers all major areas, such as numerical ...