Search
Now showing items 1-1 of 1
Pelabelan (k, d)-graceful pada -tree dan Subdivisi dari -treek, d)-graceful Labeling on -tree and Subdivision of -tree.
(2012)
This manuscript proved that every -tree and subdivision of -tree could be labeled by using (k, d)-graceful labeling for every positive integers k and d. (k, d)-graceful labeling on a graph is a graceful labeling ...