skip to main content

PELABELAN SUPER GRACEFUL UNTUK BEBERAPA GRAF KHUSUS


How to cite (IEEE): P. T. A. Anjani, and R. Heri SU, "PELABELAN SUPER GRACEFUL UNTUK BEBERAPA GRAF KHUSUS," Jurnal Matematika, vol. 1, no. 1, pp. 183-203, Oct. 2012. [Online]. Retrieved from :
Citation Format:
Abstract
Given a graph , super graceful labeling is bijective function  such that  for every edge . A graph  that has a super graceful labeling called a super graceful graph. In this  final paper discuss about super graceful labeling for special graphs graph Pn , graph Pm(n) , graph Pn+-e1 , graph Cn n≥3 graph Pn1,2,…,n , graph Km,n , and graph Coconut tree
Fulltext View|Download
Keywords: Graph labeling, super graceful labeling, super graceful graph.

Last update:

No citation recorded.

Last update:

No citation recorded.