Poh-Hwa Ong

Antimagic Labeling of Graph Unions of Trees and 4-Cycles

Let $G(V,E)$ be a graph with $V(G)$ as the set of vertices and $E(G)$ as the set of edges. A labeling is a bijection $f:E(G)\to\{1,2,\cdots, |E(G)|\}$. For each vertex \(v\), let \(\phi(v)\) be the sum of the labels on the edges incident to \(v\). If all values \(\phi(v)\) are distinct, the labeling is antimagic, and t...