A graph G admits an (a; d)-H-antimagic covering if there is a bijective function _ : V (G)?E(G) ? {1; 2; : : : ; |V (G)|+|E(G)|} such that for all subgraphs H' isomorphic to H, the H-weights w(H') = _v?V (H')_(v) + _e?E(H')_(e) constitute an arithmetic progression a; a+d; a+2d; : : : ; a+(t-1)d where a and d are positive integers and t is the number of subgraphs of G isomorphic to H. Additionally, G is said to be an H-super antimagic covering if f(V ) = {1; 2; : : : ; |V |} where s(f) is a super antimagic sum. The aims of this research are to _nd (a; d)-C3-antimagic covering on fan for d ? {2; 4}, (a; d)-K1;3-antimagic covering on sun (Sn) for n odd, and (a; d)-K1;3- antimagic covering on generalized Petersen (GPn;k) for n odd. The method o...
AbstractLet G=(V,E) be a simple graph and H be a subgraph of G. G admits an H-covering, if every edg...
A simple graph $G=(V(G),E(G))$ admits an $H$-covering if $\forall \ e \in E(G)\ \Rightarrow\ e \in E...
A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to...
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...
A graph G(V,E) has a H-covering if every edge in E belongs to a sub-graph of G isomorphic to H. An (...
A simple graph G = (V; E) admits an H-covering if every edge in E belongs to at least one subgraph o...
A graph $G(V,E)$ has a $\mathcal{H}$-covering if every edge in $E$ belongs to a subgraph of $G$ isom...
A simple graph G = (V, E) admits an H-covering, if every edge in E(G) belongs to a subgraph of G iso...
Let G = (V (G),E(G)) be a simple graph and H be a subgraph of G. G admits an H-covering, if every ed...
An (a,d)-H-antimagic total labeling of a simple graph G admitting an H-covering is a bijection φ:V(G...
A graph $G(V,E)$ has a $\mathcal{H}$-covering if every edge in $E$ belongs to a subgraph of $G$ isom...
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 an H covering if every edge in E belongs to a subgraph of G isomorphic...
A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to...
Prostý graf G má H-pokrytí, jestliže každá hrana v E(G) je v podgrafu grafu G, isomorfním s H, a (a,...
AbstractLet G=(V,E) be a simple graph and H be a subgraph of G. G admits an H-covering, if every edg...
A simple graph $G=(V(G),E(G))$ admits an $H$-covering if $\forall \ e \in E(G)\ \Rightarrow\ e \in E...
A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to...
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...
A graph G(V,E) has a H-covering if every edge in E belongs to a sub-graph of G isomorphic to H. An (...
A simple graph G = (V; E) admits an H-covering if every edge in E belongs to at least one subgraph o...
A graph $G(V,E)$ has a $\mathcal{H}$-covering if every edge in $E$ belongs to a subgraph of $G$ isom...
A simple graph G = (V, E) admits an H-covering, if every edge in E(G) belongs to a subgraph of G iso...
Let G = (V (G),E(G)) be a simple graph and H be a subgraph of G. G admits an H-covering, if every ed...
An (a,d)-H-antimagic total labeling of a simple graph G admitting an H-covering is a bijection φ:V(G...
A graph $G(V,E)$ has a $\mathcal{H}$-covering if every edge in $E$ belongs to a subgraph of $G$ isom...
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 an H covering if every edge in E belongs to a subgraph of G isomorphic...
A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to...
Prostý graf G má H-pokrytí, jestliže každá hrana v E(G) je v podgrafu grafu G, isomorfním s H, a (a,...
AbstractLet G=(V,E) be a simple graph and H be a subgraph of G. G admits an H-covering, if every edg...
A simple graph $G=(V(G),E(G))$ admits an $H$-covering if $\forall \ e \in E(G)\ \Rightarrow\ e \in E...
A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to...