Distance magic graphs of high regularity

Petr Kovář, Adam Silber, S. Arumugam · AKCE International Journal of Graphs and Combinatorics · 2020

A distance magic labeling of a graph G with n vertices is such a bijection f from the vertex set of G to the set of integers {1, 2, …, n} that for every vertex in G the sum of labels of all adjacen...

Read the paper · More papers on PaperTik