4 problems

Let $T$ be a tree with at least three vertices. An antimagic labeling is an edge labeling by the numbers $\{1,2,\dots,|E(T)|\}$ such that the sums of the labels of the edges incide…

Let $A$ be a finite Abelian group, and write $I(A)$ for the set of involutions of $A$. Set $A^*=A\setminus\{0\}$. An $A^*$-antimagic labeling of a graph with $|A|$ vertices is a bi…

Let $A$ be a finite Abelian group, and let $T$ be a tree. An $A$-antimagic labeling is an edge labeling whose induced vertex sums are pairwise distinct. Tree antimagic conjecture.…

Let $G$ be a simple connected graph, and let an antimagic labeling be a bijection from $E(G)$ to $\{1,\dotsc,|E(G)|\}$ for which the vertex sums—the sums of labels on edges inciden…