C-m-supermagic labeling of polygonal snake graphs

Abstract

An H-supermagic labeling of a graph G admitting an H-covering was defined by Guiterrez and Llado [A. Guiterrez, A. Llado, J. Combin. Math. Combin. Comput., 55 (2005), 43-56]. In this work, we shall show that polygonal snake graphs admit C-m-supermagic labeling.