Bitopological Harmonious Labeling Of Some Acyclic Graphs By Using Python Program

Abstract

In this paper, we define a new type of labeling called bitopological harmonious labeling in such a way that for a graph  with vertices, bitopological harmonious labeling is an injective function , where X is any non – empty set such that  and  forms a topology on , that induces an injective function , defined  for every  such that  forms a topology on where . A graph that admits bitopological harmonious labeling is called a bitopological harmonious graph. In this paper, we discuss bitopological harmonious labeling of some acyclic graphs and to generate these labels by using python program code.