$H$-supermagic labelings for firecrackers, banana trees and flowers
Discrete Mathematics
2018-01-17 v2 Combinatorics
Abstract
A simple graph admits an -covering if every edge in is contained in a subgraph of which is isomorphic to . In this case we say that is -supermagic if there is a bijection such that and is constant over all subgraphs of which are isomorphic to . In this paper, we show that for odd and arbitrary , the firecracker is -supermagic, the banana tree is -supermagic and the flower is -supermagic.
Keywords
Cite
@article{arxiv.1607.07911,
title = {$H$-supermagic labelings for firecrackers, banana trees and flowers},
author = {Rachel Wulan Nirmalasari Wijaya and Andrea Semaničová-Feňovčíková and Joe Ryan and Thomas Kalinowski},
journal= {arXiv preprint arXiv:1607.07911},
year = {2018}
}