Examples of distance magic labelings of the 66-dimensional hypercube

preprint2021arXivOpen access

Abstract

A distance magic labeling of an nn-dimensional hypercube is a labeling of its vertices by natural numbers from {0,…,2n−1}\{0, \ldots, 2^n-1\}, such that for all vertices vv the sum of the labels of the neighbors of vv is the same. Such a labeling is called neighbor-balanced, if, moreover, for each vertex vv and an index i=0,…,n−1i=0,\ldots,n-1, exactly half of the neighbors of vv have digit 11 at ii-th position of the binary representation of their label. We demonstrate examples of non-neighbor-balanced distance magic labelings of 66-dimensional hypercube obtained by a SAT solver.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.