A graceful labeling of symmetrical bi-Seesaw caterpillar
Ahmad Termimi Ab Ghani, Yoong Kooi Kuan · AIP conference proceedings · 2018
Any class of trees with n vertices is said to be a graceful graph if it has a graceful labeling. A graceful labeling of a graph G is a mapping of function f:V → {1,2,…, n} for every vertex such that each edge is labeled a distinct integer {1,2,…, n −1}, where the label of each edge is equal to the absolute value of the difference between a pair of vertices on its endpoints. In this paper, a symmetrical bi-Seesaw caterpillar is introduced and also proved that it can be gracefully labelled.