A graph $G(V,E)$ has a $\mathcal{H}$-covering if every edge in $E$ belongs to a subgraph of $G$ isomorphic to $\mathcal{H}$. An $(a,d)$-$\mathcal{H}$-antimagic total covering is a total labeling $\lambda$ from $V(G)\cup E(G)$ onto the integers $\{1,2,3,...,|V(G)\cup E(G)|\}$ with the property that, for every subgraph $A$ of $G$ isomorphic to $\mathcal{H}$ the $\sum{A}=\sum_{v\in{V(A)}}\lambda{(v)}+ \sum_{e\in{E(A)}}\lambda{(e)}$ forms an arithmetic sequence. A graph that admits such a labeling is called an $(a,d)$-$\mathcal{H}$-antimagic total covering. In addition, if $\{\lambda{(v)}\}_{v\in{V}}=\{1,...,|V|\}$, then the graph is called $\mathcal{H}$-super antimagic graph. In this paper we study a super $(a,d)$-$\mathcal{H}$-antimagic total...
Let ( ) and ( ) be simple and finite graphs, and be a subgraph of . Let | | | | | | dan | | . Cov...
A simple graph G = (V; E) admits an H-covering if every edge in E belongs to at least one subgraph o...
AbstractLet H be a graph. Graph G = (V, E) admits a H-covering, if every edge in E(G) belongs to at ...
A graph $G(V,E)$ has a $\mathcal{H}$-covering if every edge in $E$ belongs to a subgraph of $G$ isom...
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 (...
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...
A simple graph G = (V, E) admits an H-covering, if every edge in E(G) belongs to a subgraph of G iso...
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...
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...
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 graph G admits an (a; d)-H-antimagic covering if there is a bijective function _ : V (G)?E(G) ? {1...
Let \(G=(V,E)\) be a~finite simple graph with \(|V(G)|\) vertices and \(|E(G)|\) edges. An edge-cove...
A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to...
An (a,d)-H-antimagic total labeling of a simple graph G admitting an H-covering is a bijection φ:V(G...
Let ( ) and ( ) be simple and finite graphs, and be a subgraph of . Let | | | | | | dan | | . Cov...
A simple graph G = (V; E) admits an H-covering if every edge in E belongs to at least one subgraph o...
AbstractLet H be a graph. Graph G = (V, E) admits a H-covering, if every edge in E(G) belongs to at ...
A graph $G(V,E)$ has a $\mathcal{H}$-covering if every edge in $E$ belongs to a subgraph of $G$ isom...
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 (...
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...
A simple graph G = (V, E) admits an H-covering, if every edge in E(G) belongs to a subgraph of G iso...
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...
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...
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 graph G admits an (a; d)-H-antimagic covering if there is a bijective function _ : V (G)?E(G) ? {1...
Let \(G=(V,E)\) be a~finite simple graph with \(|V(G)|\) vertices and \(|E(G)|\) edges. An edge-cove...
A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to...
An (a,d)-H-antimagic total labeling of a simple graph G admitting an H-covering is a bijection φ:V(G...
Let ( ) and ( ) be simple and finite graphs, and be a subgraph of . Let | | | | | | dan | | . Cov...
A simple graph G = (V; E) admits an H-covering if every edge in E belongs to at least one subgraph o...
AbstractLet H be a graph. Graph G = (V, E) admits a H-covering, if every edge in E(G) belongs to at ...