Labeling of Chain Bipartite Graphs

摘要

A chain bipartite graph is a graph whose graph vertices can be partitioned into n disjoint sets so that no two vertices within the same set are adjacent and only between any two sets edges are connected. Also, it is known by clustered bipartite graph. In this paper it is proved that chain bipartite graph satisfies graceful and alpha-labeling. Graceful labeling proves the uniqueness between and within clusters and improves in the distributed computing techniques to the solution of computationally intensive applications across networks of computers.