Antimagicness of graphs with a dominating clique

Grégoire Beaudoire, Cédric Bentz, Christophe Picouleau

A graph $G=(V,E)$ is called antimagic if there exists a bijective labelling $f:E\to \{1,2,\dots ,|E|\}$ such that the vertex-sums of labels over edges incident to…