A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

Graph theory, and graph labeling in particular, are fast-growing research areas in
mathematics. New results are constantly being discovered and published at a rapidly …

This paper takes a close look at graceful labelling and its applications. We pay special
attention to the famous Graceful Tree Conjecture, which has attracted a lot of interest and …

A tree of order n is said to be graceful if the vertices can be assigned the labels {0,..., n− 1}
such that the absolute value of the differences in vertex labels between adjacent vertices …

A note on the number of graceful labellings of paths Page 1 Discrete Mathematics 261 (2003)
27–30 www.elsevier.com/locate/disc A note on the number of graceful labellings of paths REL …

Various types of labelings of graphs have been intensively studied by combinatorialists for
some time. The notion of magic labeling has its origin in very classical Chinese mathematics …

A graph $ G $ on $ m $ edges is considered graceful if there is a labelling $ f $ of the
vertices of $ G $ with distinct integers in the set $\{0, 1,\dots, m\} $ such that the induced …

New families of graphs that have 0~-labelings Hunter S. Snevily Page 1 ELSEVIER Discrete
Mathematics 170 (1997) 185-194 DISCRETE MATHEMATICS New families of graphs that have …

Abstract A (p, q)-graph G is called super edge-magic if there exists a bijective function f: V
(G)∪ E (G)→{1, 2,..., p+ q} such that f (u)+ f (υ)+ f (uυ) is a constant for each uυ ε E (G) and f …

We study the Häggkvist conjecture which states that, for each tree T with n edges, there is an
edge-partition of the complete bipartite graph K n, n into n isomorphic copies of T. We use …