paper

Distance magic labelings of product graphs

arXiv:1712.04879

Abstract

A graph is said to be distance magic if there exists a bijection and a constant {\sf k} such that for any vertex , , where is the set of all neighbours of . In this paper we shall study distance magic labelings of graphs obtained from four graph products: cartesian, strong, lexicographic, and cronecker. We shall utilise magic rectangle sets and magic column rectangles to construct the labelings.

arXiv comment21 pages, the Second Malta Conference in Graph Theory and Combinatorics

Cited by in corpus (1)