H-supermagic labelings for firecrackers, banana trees and flowers

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 E\1,… V+ E\ such that f(V)=\1,…, V\ and Σv∈ V(H')f(v)+Σe∈ 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 Fk,n is F2,n-supermagic, the banana tree Bk,n is B1,n-supermagic and the flower Fn is C3-supermagic.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…