Some distance magic graphs
A graph , where and is said to be a distance magic graph if there exists a bijection from the vertex set to the set such that, , for all , which is a constant and independent of , where is the open neighborhood of the vertex . The constant is called the distance magic constant of the graph and such...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Taylor & Francis Group
2018-04-01
|
| Edice: | AKCE International Journal of Graphs and Combinatorics |
| Témata: | |
| On-line přístup: | http://dx.doi.org/10.1016/j.akcej.2018.02.004 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|