Open AccessA Heuristic for Distance Magic Labeling
Author(s) -
Fuad Yasin,
Rinovia Simanjuntak
Publication year - 2015
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2015.12.083
Subject(s) - magic (telescope) , bijection , computer science , vertex (graph theory) , combinatorics , heuristic , graph labeling , graph , algorithm , theoretical computer science , mathematics , artificial intelligence , physics , line graph , graph power , quantum mechanics
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom