| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 488607 | Procedia Computer Science | 2015 | 5 Pages |
Abstract
A distance magic labeling of a graph G with magic constant k is a bijection λ from the V(G) into {1, 2,. . ., |V(G)|}, such that ∑u∈N(v) λ(u) = k for every vertex v. Here we present a heuristic algorithm for finding distance magic graphs and utilise it to find all distance magic graphs with at most 9 vertices.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
