A. Lev

most citedDense graphs are antimagic

105 citations · 105 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2006

Upper Bounds on the Automorphism Group of a Graph

Ilia Krasikov, Arie Lev, Bhalchandra D. Thatte

We give upper bounds on the order of the automorphism group of a simple graph

math.CO2003★ 105 cited

Dense graphs are antimagic

N. Alon, G. Kaplan, A. Lev +2

An {\em 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 dis…