Pelabelan Felicitous pada Graf Ular Berlipat

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.