z-logo
open-access-imgOpen Access
On binary operation graphs
Author(s) -
Manal N. Al-Harere,
Ahmed A. Omran
Publication year - 2019
Publication title -
boletim da sociedade paranaense de matemática
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.347
H-Index - 15
eISSN - 2175-1188
pISSN - 0037-8712
DOI - 10.5269/bspm.v38i7.44282
Subject(s) - combinatorics , binary number , graph , graph labeling , computer science , mathematics , discrete mathematics , line graph , voltage graph , arithmetic
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here