4 papers
Antimagicness of join graphs
Grégoire Beaudoire, Cédric Bentz, Christophe Picouleau
An antimagic labelling of a graph G = (V,E) is a bijection from E to {1,2,...,|E|}, such that all vertex-sums are pairwise distinct, where the vertex-sum of each vertex is the sum…
Antimagic labelling of graphs with maximum degree
Grégoire Beaudoire, Cédric Bentz, Christophe Picouleau
An antimagic labelling of a graph is a bijection from to , such that all vertex-sums are pairwise distinct, where the vertex-sum of each verte…
Antimagicness of graphs with a dominating clique
Grégoire Beaudoire, Cédric Bentz, Christophe Picouleau
A graph is called antimagic if there exists a bijective labelling such that the vertex-sums of labels over edges incident to…
Antimagic labellings of (k, 2)-bipartite biregular graphs
Grégoire Beaudoire, Cédric Bentz, Christophe Picouleau
An antimagic labelling of a graph is a bijection from the set of edges to , such that all vertex-sums are pairwise distinct, where the vertex-sum of a vertex…