An H-magic labeling in an H-decomposable graph G is a bijection f:V(G) U E(G) --> {1,2, … ,p+q} such that for every copy H in the decomposition, $\sum\limits_{v\in V(H)} f(v)+\sum\limits_{e\in E(H)} f(e)$ is constant. The function f is said to be H-E-super magic if f(E(G)) = {1,2, … ,q}. In this paper, we study some basic properties of m-factor-E-super magic labelingand we provide a necessary and sufficient condition for an even regular graph to be 2-factor-E-super magic decomposable. For this purpose, we use Petersen's theorem and magic squares
<p>A graph G of order p and size q is called super edge-magic if there exists a bijective function f...
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
Let G be a finite graph with p vertices and q edges. A vertex magic total labelling is a bijection f...
<p>An H-magic labeling in an H-decomposable graph G is a bijection f:V(G) U E(G) --> {1,2, … ,p+q...
Let G be any graph and let {Hi}i∈I be a family of graphs such that E(Hi) ∩ E(Hj ) = ∅ when i 6= j, ∪...
Let H and G be two simple graphs. The concept of an H-magic decomposition of G arises from the combi...
AbstractA simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomo...
AbstractA decomposition of a graph G into isomorphic copies of a graph H is H-magic if there is a bi...
AbstractLet H and G be two graphs. The concept of an H-supermagic decomposition of G arises from the...
Let G be a finite graph with p vertices and q edges. A vertex magic total labeling is a bijection f ...
AbstractLet G be a finite simple graph with p vertices and q edges. A vertex magic total labeling is...
Let H be a graph. A graph G = (V,E) is said to be H-magic if every edge of G belongs to at least one...
A graph G admits an H-covering if every edge of G belongs to a subgraph isomorphic to a given graph ...
A simple graph G = (V,E) admits an H-covering if every edge in E belongs to a subgraph of G isomorph...
A graph G of order p and size q is called super edge-magic if there exists a bijective function f fr...
<p>A graph G of order p and size q is called super edge-magic if there exists a bijective function f...
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
Let G be a finite graph with p vertices and q edges. A vertex magic total labelling is a bijection f...
<p>An H-magic labeling in an H-decomposable graph G is a bijection f:V(G) U E(G) --> {1,2, … ,p+q...
Let G be any graph and let {Hi}i∈I be a family of graphs such that E(Hi) ∩ E(Hj ) = ∅ when i 6= j, ∪...
Let H and G be two simple graphs. The concept of an H-magic decomposition of G arises from the combi...
AbstractA simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomo...
AbstractA decomposition of a graph G into isomorphic copies of a graph H is H-magic if there is a bi...
AbstractLet H and G be two graphs. The concept of an H-supermagic decomposition of G arises from the...
Let G be a finite graph with p vertices and q edges. A vertex magic total labeling is a bijection f ...
AbstractLet G be a finite simple graph with p vertices and q edges. A vertex magic total labeling is...
Let H be a graph. A graph G = (V,E) is said to be H-magic if every edge of G belongs to at least one...
A graph G admits an H-covering if every edge of G belongs to a subgraph isomorphic to a given graph ...
A simple graph G = (V,E) admits an H-covering if every edge in E belongs to a subgraph of G isomorph...
A graph G of order p and size q is called super edge-magic if there exists a bijective function f fr...
<p>A graph G of order p and size q is called super edge-magic if there exists a bijective function f...
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
Let G be a finite graph with p vertices and q edges. A vertex magic total labelling is a bijection f...