On closed distance magic circulants of valency up to 5

Abstract

Let =(V,E) be a graph of order n. A closed distance magic labeling of is a bijection : V \1,2, …, n\ for which there exists a positive integer r such that Σx ∈ N[u] (x) = r for all vertices u ∈ V, where N[u] is the closed neighborhood of u. A graph is said to be 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 Cay(Zn;S) where |S| 5 and S generates Zn.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…