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 c u p E o 1, l d o t s l v e r t V v e r t + l v e r t E v e r t

such that

f (V) = 1, l d o t s, l v e r t V v e r t

and

s u m_{v i n V (H^{'})} f (v) + s u m_{e i n 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.

Recommendations

Cited in

(3)

This page was built for publication: H-supermagic labelings for firecrackers, banana trees and flowers