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 |
| id |
id-itb.:36133 |
|---|---|
| spelling |
id-itb.:361332019-03-08T13:06:11ZDISTANCE ANTIMAGIC LABELING OF GRAPHS Tegar Tritama, Aholiab Indonesia Theses distance antimagic graph, graph product, generalized Petersen graphs INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/36133 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 text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| description |
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 |
| format |
Theses |
| author |
Tegar Tritama, Aholiab |
| spellingShingle |
Tegar Tritama, Aholiab DISTANCE ANTIMAGIC LABELING OF GRAPHS |
| author_facet |
Tegar Tritama, Aholiab |
| author_sort |
Tegar Tritama, Aholiab |
| title |
DISTANCE ANTIMAGIC LABELING OF GRAPHS |
| title_short |
DISTANCE ANTIMAGIC LABELING OF GRAPHS |
| title_full |
DISTANCE ANTIMAGIC LABELING OF GRAPHS |
| title_fullStr |
DISTANCE ANTIMAGIC LABELING OF GRAPHS |
| title_full_unstemmed |
DISTANCE ANTIMAGIC LABELING OF GRAPHS |
| title_sort |
distance antimagic labeling of graphs |
| url |
https://digilib.itb.ac.id/gdl/view/36133 |
| _version_ |
1822924565183987712 |