# $H$-supermagic labelings for firecrackers, banana trees and flowers

- Published in 2016
- Added on

In the collections

A simple graph $G=(V,E)$ admits an $H$-covering if every edge in $E$ is contained in a subgraph $H'=(V',E')$ of $G$ which is isomorphic to $H$. In this case we say that $G$ is $H$-supermagic if there is a bijection $f:V\cup E\to\{1,\ldots\lvert V\rvert+\lvert E\rvert\}$ such that $f(V)=\{1,\ldots,\lvert V\rvert\}$ and $\sum_{v\in V(H')}f(v)+\sum_{e\in E(H')}f(e)$ is constant over all subgraphs $H'$ of $G$ which are isomorphic to $H$. In this paper, we show that for odd $n$ and arbitrary $k$, the firecracker $F_{k,n}$ is $F_{2,n}$-supermagic, the banana tree $B_{k,n}$ is $B_{1,n}$-supermagic and the flower $F_n$ is $C_3$-supermagic.

## Links

## Other information

- key
- Hsupermagiclabelingsforfirecrackersbananatreesandflowers
- type
- article
- date_added
- 2017-09-11
- date_published
- 2016-11-28

### BibTeX entry

@article{Hsupermagiclabelingsforfirecrackersbananatreesandflowers, key = {Hsupermagiclabelingsforfirecrackersbananatreesandflowers}, type = {article}, title = {{\$}H{\$}-supermagic labelings for firecrackers, banana trees and flowers}, author = {Rachel Wulan Nirmalasari Wijaya and Andrea Semani{\v{c}}ov{\'{a}}-Fe{\v{n}}ov{\v{c}}{\'{i}}kov{\'{a}} and Joe Ryan and Thomas Kalinowski}, abstract = {A simple graph {\$}G=(V,E){\$} admits an {\$}H{\$}-covering if every edge in {\$}E{\$} is contained in a subgraph {\$}H'=(V',E'){\$} of {\$}G{\$} which is isomorphic to {\$}H{\$}. In this case we say that {\$}G{\$} is {\$}H{\$}-supermagic if there is a bijection {\$}f:V\cup E\to\{\{}1,\ldots\lvert V\rvert+\lvert E\rvert\{\}}{\$} such that {\$}f(V)=\{\{}1,\ldots,\lvert V\rvert\{\}}{\$} and {\$}\sum{\_}{\{}v\in V(H'){\}}f(v)+\sum{\_}{\{}e\in E(H'){\}}f(e){\$} is constant over all subgraphs {\$}H'{\$} of {\$}G{\$} which are isomorphic to {\$}H{\$}. In this paper, we show that for odd {\$}n{\$} and arbitrary {\$}k{\$}, the firecracker {\$}F{\_}{\{}k,n{\}}{\$} is {\$}F{\_}{\{}2,n{\}}{\$}-supermagic, the banana tree {\$}B{\_}{\{}k,n{\}}{\$} is {\$}B{\_}{\{}1,n{\}}{\$}-supermagic and the flower {\$}F{\_}n{\$} is {\$}C{\_}3{\$}-supermagic.}, comment = {}, date_added = {2017-09-11}, date_published = {2016-11-28}, urls = {http://arxiv.org/abs/1607.07911v2,http://arxiv.org/pdf/1607.07911v2}, collections = {Attention-grabbing titles,Basically computer science,Food}, url = {http://arxiv.org/abs/1607.07911v2 http://arxiv.org/pdf/1607.07911v2}, urldate = {2017-09-11}, archivePrefix = {arXiv}, eprint = {1607.07911}, primaryClass = {cs.DM}, year = 2016 }