TY - JOUR
AU - Ruvita Pertiwi
PY - 2024/04/15
Y2 - 2024/08/06
TI - Pelabelan Super Graceful pada Graf B dan Graf serta Implementasinya pada Matlab
JF - Jurnal Likhitaprajna
JA - Likhitaprajna
VL - 26
IS - 1
SE - Articles
DO - 10.37303/likhitaprajna.v26i1.280
UR - https://likhitapradnya.wisnuwardhana.ac.id/index.php/likhitapradnya/article/view/280
AB - Suppose G is a graph with vertices p dan edges q. Super graceful labeling is a one-to-one function maping on f:V(G) Ãˆ E(G) ïƒ {1,2, â€¦ , p + q} such that f(uv) = Â½f(u) â€“ f(v)Â½ differs for each edge uv ÃŽ E(G). A graph G is called super graceful if it can be labeled according to the definition of super graceful labeling. The graph B(m,n,k) is a graph consisteing of a path graph of length k conneting the star graph K(1,m) and K(1,n) at the pendant ends. Meanwhile, the graph Pn(1,2,â€¦,n) is a path graph of length by n combining each vertex on the path graph with edges i to i members (1,2,â€¦,n). In this journal, it will be shown that graph B(m,n,k) and graph Pn(1,2,â€¦,n) are super graceful graphs.
ER -