DISTANCE ANTIMAGIC LABELING OF GRAPH PRODUCTS
A graph G with order n is called distance antimagic if there exists a bijection from the set of vertices to the set of integers 1,2,…,n such that all vertex sums are pairwise distinct, where a vertex sum is the sum of maps of all vertices ajacent with that vertex. According to Kamatchi-Arumugam&#...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/20867 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |