Distance magic graphs

Let $\Gamma$ be a graph with vertex set $V$, and let $n=|V|$. A distance magic labeling of $\Gamma$ is a bijection $\ell : V \mapsto \{1,2, \ldots, n\}$ for which there exists a positive integer $r$ such that $\sum_{y \in \Gamma(x)} \ell(y) = r$ for all vertices $y \in V$, where $\Gamma(x)$ is the neighborhood of $x$. A graph is said to be distance magic if it admits a distance magic labeling. In this talk I will discuss tetravalent distance magic circulants and distance magic Hamming graphs.

  We are looking forward to meeting you at FAMNIT-MP1. 

Our Math Research Seminar will also be broadcasted via Zoom.

Join the Zoom Meeting Here.

 Everyone is welcome and encouraged to attend.