Please use this identifier to cite or link to this item: https://repository.unej.ac.id/xmlui/handle/123456789/122538
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSEPTIANA, Sella-
dc.date.accessioned2024-07-17T03:36:14Z-
dc.date.available2024-07-17T03:36:14Z-
dc.date.issued2023-07-12-
dc.identifier.urihttps://repository.unej.ac.id/xmlui/handle/123456789/122538-
dc.description.abstractFelicitous 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.isootheren_US
dc.publisherFakultas Matematika dan Ilmu Pengetahuan Alamen_US
dc.subjectPelabelan Felicitousen_US
dc.titlePelabelan Felicitous pada Graf Ular Berlipaten_US
dc.typeOtheren_US
dc.identifier.prodiMatematikaen_US
dc.identifier.validatorvalidasi_repo_iswahyudi_Mei_2024en_US
dc.identifier.finalization0a67b73d_2024_07_tanggal 10en_US
Appears in Collections:UT-Faculty of Mathematics and Natural Sciences

Files in This Item:
File Description SizeFormat 
Sella Septiana_191810101014_Repository.pdf830.9 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Admin Tools