AGUSTIN, Ika Hesti; SUSANTO, Faisal; DAFIK; PRIHANDINI, Rafiantika Megahnia; ALFARISI, Ridho; I. W. Sudarsana (2019-03-04)
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.