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 …

A diameter six tree may be represented by a set of vertices, say (a 0; a 1, a 2,..., am; b 1, b
2,..., bn; c 1, c 2,..., cr), where a 0 stands for the center of the tree and the vertices ai, i= 1 …

Abstract Aims/Objectives: To identify some new classes of graceful diameter six trees using
component moving transformation techniques. Study Design: Literature Survey to our …