CORDIAL INDEX OF HONEYCOMB NETWORK GRAPH

• 主要作者: SHOFY ADIANTO (10111020), ABDURRAHMAN
• 格式: Final Project
• 語言: Indonesia
• 在線閱讀: https://digilib.itb.ac.id/gdl/view/20671
• 機構: Institut Teknologi Bandung

For a graph G = (V,E), a binary labeling (coloring) f : V (G)-> Z2 , is said to be friendly if the diference 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 defined by f&#85...