REVERSE SUPER EDGE BIMAGIC HARMONIOUS IN SOME DIGRAPHS

Abstract

An (1, 1) in-degree reverse edge bimagic harmonious labeling of a digraph  is a bijection  for each edge , the value of  is equal to , called bimagic constants and (1, 1) out-degree reverse edge bimagic harmonious labeling of a digraph  is represented by a bijection  for each edge , the value of  is equal to , called bimagic constants. In this paper, we proved some directed graphs are both (1, 1) in-degree and out-degree reverse edge bimagic harmonious.