Anti‐magic graphs via the Combinatorial NullStellenSatz
Author:
- 20 June 2005
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 50 (4) , 263-272
Abstract
An antimagic labeling of a graph 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 that vertex. A graph is called antimagic if it has an antimagic labeling. In [10], Ringel conjectured that every simple connected graph, other than K2, is antimagic. We prove several special cases and variants of this conjecture. Our main tool is the Combinatorial NullStellenSatz (cf. [1]). © 2005 Wiley Periodicals, Inc. J Graph TheoryKeywords
This publication has 10 references indexed in Scilit:
- Dense graphs are antimagicJournal of Graph Theory, 2004
- Combinatorial NullstellensatzCombinatorics, Probability and Computing, 1999
- Colorings and orientations of graphsCombinatorica, 1992
- Regular subgraphs of almost regular graphsJournal of Combinatorial Theory, Series B, 1984
- A combinatorial proof of Dyson's conjectureDiscrete Mathematics, 1982
- The number of edge 3-colorings of a planar cubic graph as a permanentDiscrete Mathematics, 1974
- Short Proof of a Conjecture by DysonJournal of Mathematical Physics, 1970
- Proof of a Conjecture by DysonJournal of Mathematical Physics, 1962
- Proof of a Conjecture by Dyson in the Statistical Theory of Energy LevelsJournal of Mathematical Physics, 1962
- Statistical Theory of the Energy Levels of Complex Systems. IJournal of Mathematical Physics, 1962