#TITLE_ALTERNATIVE#

• Main Author: NUR ALIFAH (10112084), AMALIA
• Format: Final Project
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/21001
• Institution: Institut Teknologi Bandung

A binary vertex labeling f : V (G) -> Z2 of a graph G is called to be friendly if the number of vertices labeled 0 is almost the same as the number of vertices labeled <br /> <br /> <br /> <br /> 1. This friendly labeling induces an edge labeling f* : E(G)-> Z2 defined by f*(uv) = f(u)f(v) for all uv € E(G). Let ef (i) = {uv € E(G) : f*(uv) = i} be <br /> <br /> <br /> <br /> the number of edges of G that are labeled i. Product cordial index of the labeling f is the number pc(f) = |ef (0) - ef (1)|. The product-cordial set of the graph G, denoted by PC(G), is defined by <br /> <br /> <br /> <br /> PC(G) = {pc(f) : f is a friendly labeling of Gg: <br /> <br /> <br /> <br /> A graph G of size q is said to be fully product-cordial (or fully pc) if PC(G) = {q -2k : 0 &#8804; k &#8804; [q/2]}. <br /> <br /> <br /> <br /> In this thesis, we determine index product-cordial labeling of graphs obtained from fan graph and caterpillar graph.