Lattice Grids and Prisms are Antimagic

Details Lattice Grids and Prisms are Antimagic Lattice Grids and Prisms are Antimagic

2006-03-04

arxiv.org/abs/math/0603106v1

Mathematics

Combinatorics

10 pages, 6 figures

Scientific paper

An \emph{antimagic labeling} of a finite undirected simple 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 the same vertex. A graph is called \emph{antimagic} if it has an antimagic labeling. In 1990, Hartsfield and Ringel conjectured that every connected graph, but $K_2$, is antimagic. In 2004, N. Alon et al showed that this conjecture is true for $n$-vertex graphs with minimum degree $\Omega(\log n)$. They also proved that complete partite graphs (other than $K_2$) and $n$-vertex graphs with maximum degree at least $n-2$ are antimagic. Recently, Wang showed that the toroidal grids (the Cartesian products of two or more cycles) are antimagic. Two open problems left in Wang's paper are about the antimagicness of lattice grid graphs and prism graphs, which are the Cartesian products of two paths, and of a cycle and a path, respectively. In this article, we prove that these two classes of graphs are antimagic, by constructing such antimagic labelings.

Affiliated with

Also associated with

No associations

Rating

Lattice Grids and Prisms are Antimagic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lattice Grids and Prisms are Antimagic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lattice Grids and Prisms are Antimagic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-618906