Advances and Applications in Discrete Mathematics
Volume 1, Issue 1, Pages 91 - 108
(January 2008)
|
|
RECURSIVE CONSTRUCTIONS OF CONSECUTIVELY SUPER-EDGE-MAGIC TREES
Yasuhiro Fukuchi (Japan) and Akito Oshima (Japan)
|
Abstract: For a graph G, a bijection f from
to is
called a super-edge-magic labeling of G if
and if there exists a constant C such
that
for every edge For a tree T and a
vertex v of T, we let
denote the set of vertices of T which are at even distance from v,
and let denote the set
of vertices of T which are at odd distance from v. We say that T
is consecutively super-edge-magic if there exists a vertex
and there exists a super-edge-magic labeling f of T such that
and In
this paper, we give several recursive constructions of consecutively
super-edge-magic trees. |
Keywords and phrases: super-edge-magic labeling, consecutively super-edge-magic labeling. |
|
Number of Downloads: 240 | Number of Views: 571 |
|