Pelabelan Felicitous pada Graf Ular Berlipat
dc.contributor.author | SEPTIANA, Sella | |
dc.date.accessioned | 2024-07-17T03:36:14Z | |
dc.date.available | 2024-07-17T03:36:14Z | |
dc.date.issued | 2023-07-12 | |
dc.identifier.uri | https://repository.unej.ac.id/xmlui/handle/123456789/122538 | |
dc.description.abstract | Felicitous labeling of a graph on q edge is an injective function f:V(G)→{0,1,2,…,q}, so that each edge gets a label from the sum of the two vertex labels adjacent to that edge modulo q. A graph G that obeys the rules of felicitous labeling is called a felicitous graph. This research discusses the felicitous labeling of folded snake graphs (C_4,2^k (r)). Folded snake graph is a graph obtained from the join of k-complate bipartite graphs K_2,2r with a connecting point between the graph K_2,2r to-i and K_2,2r to-i+1 which is vertebrae points 2. The purpose of this research is to find out whether the folded snake graph(C_4,2^k (r)) with k≥1 and r≥1 is a felicitous graph or not. The results of this research prove that the folded snake graphs (C_4,2^k (r)) with k≥1 and r≥1 is a felicitous graph. | en_US |
dc.language.iso | other | en_US |
dc.publisher | Fakultas Matematika dan Ilmu Pengetahuan Alam | en_US |
dc.subject | Pelabelan Felicitous | en_US |
dc.title | Pelabelan Felicitous pada Graf Ular Berlipat | en_US |
dc.type | Other | en_US |
dc.identifier.prodi | Matematika | en_US |
dc.identifier.validator | validasi_repo_iswahyudi_Mei_2024 | en_US |
dc.identifier.finalization | 0a67b73d_2024_07_tanggal 10 | en_US |
Files in this item
This item appears in the following Collection(s)
-
UT-Faculty of Mathematics and Natural Sciences [3360]
Koleksi Skripsi Fakultas Matematika dan Ilmu Pengetahuan Alam