On binary operation graphs

Abstract

Labeled graphs are the the graphs that their vertices or edges or to both assigned labels of integers according to a certain conditions. Given a graph G = (V, E), a vertex labeling is a function of V to a set of labels. A graph with such a function defined is called a vertex-labeled graph. The concept of labeled graph generally refers to a vertex-labeled graph with all labels distinct. In this work, new results of graph labeling” binary operation labeling” are determined. Binary operation labeling is a type of labeling graphs by vertices.