PELABELAN GRACEFUL PADA GRAF LINTASAN Pn
| Main Authors: | Suwarman, Ramdhan Fazrianto, Inayah, Nur, Irene, Yanne |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
UNIVERSITAS NEGERI MALANG
, 2022
|
| Online Access: |
http://journal2.um.ac.id/index.php/jkma/article/view/30530 http://journal2.um.ac.id/index.php/jkma/article/view/30530/pdf |
Daftar Isi:
- A simple graph G=(V, E) with n vertices and m edges is called graceful, if that graph G can be labeled with a bijection f:V(G) {1, 2, .., n} and g:E(G) {1, 2, .., m}, with condition label on any edge equals the difference between the labels of the two endpoints. This study examined graceful labeling on path graph Pn for n>=3.