Nacionalni portal odprte znanosti

A graph is distance magic if it admits a bijective labeling of its vertices by integers from 1 up to the order of the graph in such a way that the sum of the labels of all the neighbors of a vertex is independent of a given vertex. We introduce the concept of a self-reverse distance magic labeling o ...