Yongxi Cheng

most citedCartesian Products of Regular Graphs are Antimagic

3 citations · 4 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2006★ 1 cited

Lattice Grids and Prisms are Antimagic

Yongxi Cheng

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$ ve…

math.CO2006★ 3 cited

Cartesian Products of Regular Graphs are Antimagic

Yongxi Cheng

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$ ve…