CORDIAL INDEX OF HONEYCOMB NETWORK GRAPH

• Main Author: Shofy Adianto, Abdurrahman
• Format: Final Project
• Language: Indonesia
• Subjects: Ilmu alam dan matematika
• Online Access: https://digilib.itb.ac.id/gdl/view/33859
• Institution: Institut Teknologi Bandung

For a graph G = (V;E), a binary labeling (coloring) f : V (G) ! Z2 , is said to be friendly if the dierence between the number of vertices labeled 0 and vertices labeled 1 is at most 1. The friendly labeling f : V (G) ! Z2 induces an edge labeling f : E(G) ! Z2 dened by f(xy) = jf(x)????f(y)j; 8x...