加载中…
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 .

生成讲解博客的中文版本

生成AI智能校验的中文版本