1 paper
Ehab Ebrahem, Shlomo Hoory, Dani Kotlar
This work is about a partition problem which is an instance of the distance magic graph labeling problem. Given positive integers n,k and p1≤p2≤⋯≤pk such that…