Cichacz–Froncek conjecture on distance magic graphs
Cichacz–Froncek conjecture on distance magic graphs
Let be a graph. A distance magic labeling of is a bijection from its vertices to the cyclic group of order for which every vertex has the same neighbor-sum. A graph is group distance magic if it admits a -distance magic labeling for every Abelian group of order .
Cichacz–Froncek conjecture. If is a distance magic graph, then is group distance magic.
The conjecture asks whether existence of a distance magic labeling with the cyclic group always implies existence of such a labeling for every Abelian group of the same order. The source presents this as an open conjecture and notes that many distance magic graphs are already known to be group distance magic.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Sylwia Cichacz, Dalibor Froncek and Paweł Dyrlaga, “Group distance magic Cartesian product of two cycles”, arXiv:1905.04946 (2019).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.