DISTANCE ANTIMAGIC LABELING OF GRAPHS
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-Ar...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/36133 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | 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’s conjecture, every graph without
two vertices having the same neighborhood is distance antimagic.
In this book, we present results on distance antimagic labeling for graphs obtained
from direct, strong, Kronecker product, generalized Petersen graphs, and circulant
graphs. Our main tool is by arranging labels of |
|---|