Article Per Year (5 Year)
p-Index From 2019 - 2024
1.756
P-Index
This Author published in this journals
All Journal JSME MIPA UNIMA Journal on Education Jurnal Review Pendidikan dan Pengajaran (JRPP) SOSCIED Jurnal Lebesgue : Jurnal Ilmiah Pendidikan Matematika, Matematika dan Statistika MARISEKOLA: Jurnal Matematika Riset Edukasi dan Kolaborasi Education Journal: General and Specific Research Inspirasi Dunia: Jurnal Riset Pendidikan dan Bahasa
Patricia V. J. Runtu
Universitas Negeri Manado
Humanities Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Languange, Linguistic, Communication & Media Mathematics Social Sciences Other

Published : 14 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : SOSCIED

 1 
BEBERAPA ALGORITMA PELABELAN GRACEFUL UNTUK GRAF CATERPILLAR Regina N Pakpahan; Patricia V. J Runtu; Meidy Atina Kuron
SOSCIED Vol 6 No 1 (2023): SOSCIED - Juli 2023
Publisher : LPPM Politeknik Saint Paul Sorong

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32531/jsoscied.v6i1.690

Abstract

Graceful labeling, first introduced by Rosa as β-labeling. A graceful labeling (or β-labeling) on a graph G involves assigning labels to its set of vertices, forming an injective function f that maps each vertex to the set of non-negative integers {0, 1, 2, ..., |E(G)|}, where |E(G)| denotes the number of edges in G. This induces a bijective function f* that maps the edges of G to the set of positive integers {1,2,...,|E(G)|} which the edges label obtained by absolute number of the subtraction between 2 neighboring vertex labels. One renowned conjecture proposed by Kotzig-Ringel-Rosa, known as the Graceful Tree Conjecture (GTC), posits that all trees are graceful. To this day, this remains an open problem, challenging researchers to substantiate its validity. The quest for graceful labeling, particularly for specific types of trees, continues to be an active zona of research. Notably, caterpillar graphs have been established as graceful. It is worth noting that not all graphs possess a unique labeling. For instance, in the case of graceful labeling for caterpillar graphs, there exist four distinct methods, which will be elucidated algorithmically in this article. By demonstrating various approaches to labeling caterpillar graphs, it is hoped that this concept can be extended to other graceful labelings, ultimately contributing to the identification of more graceful trees
Co-Authors Angelin Adeleyda Nangon Deiby N. F. Tiwow Djumati, Ferdianto Dwiputra, I Made Greiselah Manoka Halean, Vine Ichdar Domu Jhon R Wenas John R. Wenas Jorie Emor Jorry F Monoarfa Kindangen, Holly Th. D. Kinzie F. Pinontoan Meidy Atina Kuron Navel Oktaviandy Mangelep Nicky Kurnia Tumalun Oktavia Muhati Regina N Pakpahan Rengkuan, Cikita Rosiah J. Pulukadang Rotti, Herwin Y. Selfie L. Kumesan Syanet Kontur Toar M. Kamagi Vivian E. Regar