On magic labelings of Möbius ladders (Q913821)

This paper deals with magic and consecutive labelings of plane finite undirected graphs \(G=(V,E,F)\) without loops and multiple edges, where G has the vertex set V, the edge set E and the face set F. The author investigates so called Möbius ladders \(L^ m_ n\) and shows the existence of magic vertex labelings, consecutive edge labelings and magic labelings of type (1,1,1) for odd \(n\geq 3\) and \(m\geq 1\).