On closed distance magic circulants of valency up to $5$
Combinatorics
2022-12-26 v1
Abstract
Let be a graph of order . A {\em closed distance magic labeling} of is a bijection for which there exists a positive integer such that for all vertices , where is the closed neighborhood of . A graph is said to be {\em closed distance magic} if it admits a closed distance magic labeling. In this paper, we classify all connected closed distance magic circulants with valency at most , that is, Cayley graphs where and generates .
Cite
@article{arxiv.2212.12441,
title = {On closed distance magic circulants of valency up to $5$},
author = {Blas Fernández and Roghayeh Maleki and Štefko Miklavič and Andriaherimanana Sarobidy Razafimahatratra},
journal= {arXiv preprint arXiv:2212.12441},
year = {2022}
}