AbstractLet 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) belongs to at least one subgraph of G that is isomorphic to H. An (a,d)-H-antimagic total labeling of G is bijection f:V(G)∪E(G)→{1,2,3,…,|V(G)|+|E(G)|} such that for all subgraphs H′ of G isomorphic to H, the H′ weights w(H′)=∑v∈V(H′)f(v)+∑e∈E(H′)f(e) constitute an arithmetic progression a,a+d,a+2d,…,a+(n−1)d where a and d are positive integers and n is the number of subgraphs of G isomorphic to H. Additionally, the labeling f is called a super (a,d)-H-antimagic total labeling if f(V(G))={1,2,3,…,|V(G)|}. In this paper we study super (a,d)-Ph- antimagic total labeling of the Star
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 belongs to at least one subgraph o...
A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to...
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...
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...
Let ( ) and ( ) be simple and finite graphs, and be a subgraph of . Let | | | | | | dan | | . Cov...
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 (...
An (a,d)-H-antimagic total labeling of a simple graph G admitting an H-covering is a bijection φ:V(G...
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...
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) is said to be an H-covering if every edge of G belongs to at least one subgra...
Let H and G be finite simple graphs where every edge of G belongs to at least one subgraph that is i...
A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to...
An <i>(a,d)-edge antimagic total labeling of a (p, q)</i>-graph G is bijection f:V∪E→{1,2,3,…,p+q} w...
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 belongs to at least one subgraph o...
A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to...
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...
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...
Let ( ) and ( ) be simple and finite graphs, and be a subgraph of . Let | | | | | | dan | | . Cov...
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 (...
An (a,d)-H-antimagic total labeling of a simple graph G admitting an H-covering is a bijection φ:V(G...
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...
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) is said to be an H-covering if every edge of G belongs to at least one subgra...
Let H and G be finite simple graphs where every edge of G belongs to at least one subgraph that is i...
A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to...
An <i>(a,d)-edge antimagic total labeling of a (p, q)</i>-graph G is bijection f:V∪E→{1,2,3,…,p+q} w...
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 belongs to at least one subgraph o...
A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to...