A Novel Approach for Cyclic Decompositions of Balanced Complete Bipartite Graphs into Infinite Graph Classes

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...

Full description

Saved in:
Bibliographic Details
Published in:Journal of function spaces 2022-01, Vol.2022, p.1-12
Main Authors: El-Mesady, A., Bazighifan, Omar, Askar, S. S.
Format: Article
Language:English
Subjects:
Apexes
Codes
Decomposition
Graph theory
Graphs
Labeling
Trees (mathematics)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 Kn,n by the graph G. By applying the proposed orthogonal labeling technique, we had constructed decompositions of Kn,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.
ISSN:2314-8896
2314-8888
DOI:10.1155/2022/9308708