posted on 2025-05-11, 13:18authored byRachel Wulan Nirmalasari Wijaya, Andrea Semanicová-Fenovcíková, Joseph RyanJoseph Ryan, Thomas Kalinowski
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)+∑vϵV(H')f(e) is constant over all subgraphs H' of G which are isomorphic to H. Extending results from [M. Roswitha and E.T. Baskoro, Amer. Inst. Physics Conf. Proc. 1450 (2012), 135-138], we show that the firecracker Fk,n is F2,n-supermagic, the banana tree Bk,n is Bk-1,n-supermagic and the flower Fn is C3-supermagic.
History
Journal title
Australasian Journal of Combinatorics
Volume
69
Issue
3
Pagination
442-451
Publisher
Centre for Discrete Mathematics & Computing, University of Queensland