Orientable ℤN-Distance Magic Graphs
Let G = (V, E) be a graph of order n. A distance magic labeling of G is a bijection ℓ: V → {1, 2, . . ., n} for which there exists a positive integer k such that ∑x∈N(v)ℓ(x) = k for all v ∈ V, where N(v) is the open neighborhood of v.
| Principais autores: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | English |
| Publicado em: |
University of Zielona Góra
2019-05-01
|
| coleção: | Discussiones Mathematicae Graph Theory |
| Assuntos: | |
| Acesso em linha: | https://doi.org/10.7151/dmgt.2094 |