On H-Supermagic Labelings of m-Shadow of Paths and Cycles

Abstract

The labeling f is called super if the smallest possible labels appear on the vertices. A graph that admits (super) (a,d)-H-antimagic total labeling is called (super) (a,d)-H-antimagic.