CORDIAL INDEX OF HONEYCOMB NETWORK GRAPH
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 fU...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/20671 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
Be the first to leave a comment!