SOME CLASSES OF D-ANTIMAGIC GRAPHS
In 2013, Kamatchi and Arumugam introduced the concept of a distance antimagic graph. A simple graph G is said to be distance antimagic if there is a bijection f : V (G) ? {1, 2, . . . , |V (G)|} such that for every x, y ? V (G) with x ?= y applies w(x) ?= w(y) where w(x) = P z?N(x) f(z) and N(x...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/65076 |
| 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!