On binary operation graphs

Abstract

A graph labeling is an assignment of integers to the vertices, edges, or to both, and it is subject to certain conditions. In this paper, a new concept of graph labeling called binary operation labeling is introduced. The graph is said to be a binary operation graph if admits a binary operation labeling. Some results for this new type of labeling are contributed.