1 research outputs found
-supermagic labelings for firecrackers, banana trees and flowers
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