| Autor: |
Dyrlaga, Paweł, Szopa, Karolina |
| Zdroj: |
AKCE International Journal of Graphs and Combinatorics; January 2021, Vol. 18 Issue: 1 p60-63, 4p |
| Abstrakt: |
AbstractHefetz, Mütze, and Schwartz conjectured that every connected undirected graph admits an antimagic orientation (Hefetz et al., 2010). In this paper we support the analogous question for distance magic labeling. Let be an Abelian group of order . A directed-distance magic labelingof an oriented graph of order is a bijection with the property that there is a magic constantsuch that for every In this paper we provide an infinite family of odd regular graphs possessing an orientable -distance magic labeling. Our results refer to lexicographic product of graphs. We also present a family of odd regular graphs that are not orientable -distance magic. |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
