An edge magic total labeling is a bijection α from V ∪ E to the integers 1,2,...,n + e, with the property that for every xy ∈ E, α(x) + α(y) + α(xy) = k, for some constant k. Such a labeling is called a b-edge consecutive edge magic total if α(E) = {b + 1,b + 2,...,b + e}.
In this research, we give sufficient conditions for a graph G having a super edge magic total labeling to have a b-edge consecutive edge magic total labeling.
Abstract. Let G = (V,E) be a simple, connected, and undirected graph, where V and E are the set of vertices and the set of edges of G. An edge magic total ...
An edge magic total labeling on G is a bijection (Formula Presented) provided that for every (Formula Presented) for a constant number K. Such a labeling is ...
Abstract: Let G = (V,E) be a simple, connected, and undirected graph, where V and E are the set of vertices and the set of edges of G. An edge magic total ...
regular banana trees, have a b-edge consecutive edge magic labeling for some 0<b<|V|. ... All graphs which are considered in this paper are finite, simple, ...
Oct 29, 2022 · Let G = ( V , E ) be a simple, connected, and undirected graph, where V and E are the set of vertices and the set of edges of G . An edge ...
Such a labeling is called a b-edge consecutive edge magic total if α(E) = {b + 1, b + 2, . . . , b + e}. In this paper, we proved that several classes of ...
In this paper we study the properties of a-vertex consecutive edge magic and b-edge consecutive edge magic graphs.
Let G=(V,E) be a finite (non-empty) graph, where V and E are the sets of vertices and edges of G. An edge magic total labeling is a bijection α from V∪E to ...