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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2018-04-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2018.02.004 |
| Summary: | 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 a labeling is called distance magic labeling of . In this paper, we present new results on distance magic labeling of and neighborhood expansion of a graph . |
|---|---|
| ISSN: | 0972-8600 |