Add to ORKGAn edge magic total labeling of a graph with p vertices and q edges is a bijection from the set of vertices and edges to 1,2,……………,p+q such that for every edge the sum of the label of edge and the label of its two end vertices are constant. This type of labeling is called super edge magic labeling if smallest labels are assigned to vertices. In this paper, a new graph characteristic, the complementary super edge magic labeling is introduced and we investigate whether several family of graphs have complementary super edge-magic labeling or not
Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f f...
AbstractLet G=(V,E) be a finite non-empty graph, where V and E are the sets of vertices and edges of...
AbstractLet G=(V,E) be a finite, simple and undirected graph. The edge-magic total or vertex-magic t...
Let a ( , ) p q graph G with the vertex set V G( ) , the edge set E G( ) , the number of vert...
<p>A graph G of order p and size q is called super edge-magic if there exists a bijective function f...
Let G = (V,E) be a simple, connected and undirected graph with v vertices and e edges. An edge magic...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the ve...
Let G = (V,E) be a simple, connected and undirected graph with v vertices and e edges. An edge magic...
For a graph G, with the vertex set V(G) and the edge set E(G) an edge-magic total labeling is a bije...
In this paper, we use the product ⊗h in order to study super edge-magic labelings, bi-magic labeling...
AbstractA total labeling of a graph with v vertices and e edges is defined as a one-to-one map takin...
AbstractLet G be a finite simple graph with p vertices and q edges. A vertex magic total labeling is...
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
Edge magic total labeling of ( ) is a bijective function ( ) ( ) * +, where | ( )| and | ( )| such t...
Let C = (M, N) be a finite, undirected and simple graph with |M(C)| = t and |N(C)| = s. The labeling...
Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f f...
AbstractLet G=(V,E) be a finite non-empty graph, where V and E are the sets of vertices and edges of...
AbstractLet G=(V,E) be a finite, simple and undirected graph. The edge-magic total or vertex-magic t...
Let a ( , ) p q graph G with the vertex set V G( ) , the edge set E G( ) , the number of vert...
<p>A graph G of order p and size q is called super edge-magic if there exists a bijective function f...
Let G = (V,E) be a simple, connected and undirected graph with v vertices and e edges. An edge magic...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the ve...
Let G = (V,E) be a simple, connected and undirected graph with v vertices and e edges. An edge magic...
For a graph G, with the vertex set V(G) and the edge set E(G) an edge-magic total labeling is a bije...
In this paper, we use the product ⊗h in order to study super edge-magic labelings, bi-magic labeling...
AbstractA total labeling of a graph with v vertices and e edges is defined as a one-to-one map takin...
AbstractLet G be a finite simple graph with p vertices and q edges. A vertex magic total labeling is...
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
Edge magic total labeling of ( ) is a bijective function ( ) ( ) * +, where | ( )| and | ( )| such t...
Let C = (M, N) be a finite, undirected and simple graph with |M(C)| = t and |N(C)| = s. The labeling...
Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f f...
AbstractLet G=(V,E) be a finite non-empty graph, where V and E are the sets of vertices and edges of...
AbstractLet G=(V,E) be a finite, simple and undirected graph. The edge-magic total or vertex-magic t...