Abstract
Graph theory is considered an attractive field for finding the proof techniques in discrete mathematics. The results of graph theory have applications in many areas of social, computing, and natural sciences. Graph labelings and decompositions have received much attention in the literature. Several types of graph labeling were proposed for solving the problem of decomposing different graph classes. In the present paper, we propose a technique for labeling the vertices of a bipartite graph
G
with
n
edges, called orthogonal labeling, to yield cyclic decompositions of balanced complete bipartite graphs
K
n
,
n
by the graph
G
. By applying the proposed orthogonal labeling technique, we had constructed decompositions of
K
n
,
n
by paths, trees, one factorization, disjoint union of cycles, complete bipartite graphs, disjoint union of trees, caterpillars, and so forth. From the constructed results, we can confirm that the proposed orthogonal labeling technique is effective.