Abstract
A simple graph $G=(V,E)$ admits an~$H$-covering if every edge in $E$ belongs to at least one subgraph of $G$ isomorphic to a given graph $H$. The graph $G$ admitting an $H$-covering is $(a,d)$-$H$-antimagic if there exists a~bijection $f:V\cup E\to\{1,2,\cdots,|V|+|E|\}$ such that, for all subgraphs $H'$ of $G$ isomorphic to $H$, the $H'$-weights, $wt_f(H')= \sum_{v\in V(H')} f(v) + \sum_{e\in E(H')} f(e)$, form an~arithmetic progression with the initial term $a$ and the common difference $d$. Such a labeling is called {\it super} if the smallest possible labels appear on the vertices. In this paper we prove the existence of super $(a,d)$-$H$-antimagic labelings of fan graphs and ladders for $H$ isomorphic to a cycle.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
