Lattice grids and prisms are antimagic
Theoretical Computer Science
The antimagicness of the Cartesian product of graphs
Theoretical Computer Science
Antimagic labeling and canonical decomposition of graphs
Information Processing Letters
On a relationship between completely separating systems and antimagic labeling of regular graphs
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Antimagic labelling of vertex weighted graphs
Journal of Graph Theory
Antimagic labeling graphs with a regular dominating subgraph
Information Processing Letters
Anti-magic labelling of Cartesian product of graphs
Theoretical Computer Science
On antimagic labeling of regular graphs with particular factors
Journal of Discrete Algorithms
| Hi-index | 0.00 |
An antimagic labeling of graph a with m edges and n vertices is a bijection from the set of edges to the integers 1,…,m such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with the same vertex. A graph is called antimagic if it has an antimagic labeling. A conjecture of Ringel (see 4) states that every connected graph, but K2, is antimagic. Our main result validates this conjecture for graphs having minimum degree Ω (log n). The proof combines probabilistic arguments with simple tools from analytic number theory and combinatorial techniques. We also prove that complete partite graphs (but K2) and graphs with maximum degree at least n – 2 are antimagic. © 2004 Wiley Periodicals, Inc. J Graph Theory 47: 297–309, 2004