Abstract
A graph G with k vertices is distance magic if the vertices can be labeled with numbers 1,2,⋯, k so that the sum of labels of the neighbors of each vertex is equal to the same constant μ0. We present a construction of distance magic graphs arising from arbitrary regular graphs based on an application of magic rectangles. We also solve a problem posed by Shafiq, Ali, and Simanjuntak.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 349-354 |
| Number of pages | 6 |
| Journal | Journal of Combinatorial Mathematics and Combinatorial Computing |
| Volume | 78 |
| State | Published - Aug 2011 |
Keywords
- 1-vertex-magic vertex labeling
- Distance magic labeling
- Magic rectangles
- Magic type labeling