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
Keywords: Graph labeling,
super graceful labeling, super graceful graph
Penulis: Primas Tri Anjar
Anjani, Robertus Heri SU
Kode Jurnal: jpmatematikadd120033
Artikel Terkait :
