Abstract: For a graph G,
a bijection f from to is called an edge-magic labeling of
G if there exists a constant C
such that for every edge An edge-magic labeling is called a
super-edge-magic labeling if A graph G
is called edge-magic (resp., super-edge-magic) if there exists an edge-magic (resp.,
super-edge-magic) labeling of G. In
this paper, we describe a construction of super-edge-magic labelings of some
families of trees with diameter 4.
