Alternative construction of graceful symmetric trees

Abstract

Graceful labeling is one of the interesting topics in graph theory. Let G = (V, E) be a tree. The injective mapping is called graceful if the weight of edge are all different for every edge xy. The famous conjecture in this area is all trees are graceful. In this paper we give alternative construction of graceful labeling on symmetric tree using adjacency matrix.