Distance antimagic labelings of product graphs
| Main Authors: | Wulandari, Risma Yulina; Institut Teknologi Bandung, Simanjuntak, Rinovia; Institut Teknologi Bandung |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2023
|
| Subjects: | |
| Online Access: |
https://www.ejgta.org/index.php/ejgta/article/view/1679 https://www.ejgta.org/index.php/ejgta/article/view/1679/pdf_257 https://www.ejgta.org/index.php/ejgta/article/downloadSuppFile/1679/306 |
Daftar Isi:
- A graph G is distance antimagic if there is a bijection f : V(G)→{1, 2, ..., |V(G)|} such that for every pair of distinct vertices x and y applies w(x)≠w(y), where w(x)=Σ z ∈ N(x)f(z) and N(x) is the neighbourhood of x, i.e., the set of all vertices adjacent to x. It was conjectured that a graph is distance antimagic if and only if each vertex in the graph has a distinct neighbourhood. In this paper, we study the truth of the conjecture by posing sufficient conditions and constructing distance antimagic product graphs; the products under consideration are join, corona, and Cartesian.