#TITLE_ALTERNATIVE#
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 defi...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/21001 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |