AbstractA graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to H. Suppose G admits an H-covering. A bijection f from V(G)∪E(G) to {1,2,…,|V(G)|+|E(G)|} is called an H-magic labeling of G if ∑v∈V(H′)f(v)+∑e∈E(H′)f(e) is constant for every subgraph H′ of G isomorphic to H. An H-magic labeling f of G is called an H-supermagic labeling of G if f(V(G))={1,2,…,|V(G)|}. In this paper, we investigate C4-supermagic labelings of the Cartesian product of paths and graphs
AbstractA simple graph G=(V,E) admits a cycle-covering if every edge in E belongs at least to one su...
A simple graph G = (V, E) admits an H-covering, if every edge in E(G) belongs to a subgraph of G iso...
A simple graph G = (V; E) admits an H-covering if every edge in E belongs to at least one subgraph o...
AbstractA graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic t...
AbstractA simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomo...
A simple graph G=(V,E) is said to be an H-covering if every edge of G belongs to at least one subgra...
A simple graph G = (V,E) admits an H-covering if every edge in E belongs to a subgraph of G isomorph...
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 simple graph G=(V,E) admits an H covering if every edge in E belongs to a subgraph of G isomorphic...
A graph G admits an H-covering if every edge of G belongs to a subgraph isomorphic to a given graph ...
Let G admit an H-edge covering and f : V⋃E → {1,2,…,n+e} be a bijective mapping for G then f is call...
Let H be a graph. A graph G=(V,E) admits an H-covering if every edge in E belongs to a subgraph of G...
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
Let G=(V,E) be a simple graph and H be a subgraph of G. G admits an H-covering, if every edge in E(G...
A simple graph G=(V,E) admits a cycle-covering if every edge in E belongs at least to one subgraph o...
AbstractA simple graph G=(V,E) admits a cycle-covering if every edge in E belongs at least to one su...
A simple graph G = (V, E) admits an H-covering, if every edge in E(G) belongs to a subgraph of G iso...
A simple graph G = (V; E) admits an H-covering if every edge in E belongs to at least one subgraph o...
AbstractA graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic t...
AbstractA simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomo...
A simple graph G=(V,E) is said to be an H-covering if every edge of G belongs to at least one subgra...
A simple graph G = (V,E) admits an H-covering if every edge in E belongs to a subgraph of G isomorph...
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 simple graph G=(V,E) admits an H covering if every edge in E belongs to a subgraph of G isomorphic...
A graph G admits an H-covering if every edge of G belongs to a subgraph isomorphic to a given graph ...
Let G admit an H-edge covering and f : V⋃E → {1,2,…,n+e} be a bijective mapping for G then f is call...
Let H be a graph. A graph G=(V,E) admits an H-covering if every edge in E belongs to a subgraph of G...
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
Let G=(V,E) be a simple graph and H be a subgraph of G. G admits an H-covering, if every edge in E(G...
A simple graph G=(V,E) admits a cycle-covering if every edge in E belongs at least to one subgraph o...
AbstractA simple graph G=(V,E) admits a cycle-covering if every edge in E belongs at least to one su...
A simple graph G = (V, E) admits an H-covering, if every edge in E(G) belongs to a subgraph of G iso...
A simple graph G = (V; E) admits an H-covering if every edge in E belongs to at least one subgraph o...