Hui-Min Xu

Local Antimagic Chromatic Number of Middle Graph and Direct Product of Graphs

An edge labeling of a connected graph $G=(V, E)$ is called a local antimagic labeling if it is a bijection $f: E\rightarrow \{1, 2, \cdots, \left | E \right | \}$ such that for any pair of adjacent vertices $u$ and $v$, $f^{+}(u)\neq f^{+}(v)$ where $f^{+}(x)=\sum f(e)$, with $e$ ranging over all the edges incident to...