Papers
Topics
Authors
Recent
Search
2000 character limit reached

On closed distance magic circulants of valency up to $5$

Published 23 Dec 2022 in math.CO | (2212.12441v1)

Abstract: Let $\Gamma=(V,E)$ be a graph of order $n$. A {\em closed distance magic labeling} of $\Gamma$ is a bijection $\ell : V \to {1,2, \ldots, n}$ for which there exists a positive integer $r$ such that $\sum_{x \in N[u]} \ell(x) = r$ for all vertices $u \in V$, where $N[u]$ is the closed neighborhood of $u$. 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 $5$, that is, Cayley graphs $\operatorname{Cay}(\mathbb{Z}_n;S)$ where $|S| \le 5$ and $S$ generates $\mathbb{Z}_n$.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.