On super d-face antimagic total labelings of the corona product of a tree with r copies of a path

Abstract

This paper deals with super d-face antimagic total labelings and super d-antimagic labelings of type (1,1,1) of the corona product of a tree with r copies of a path, denoted by Tn⊙rPm, where n ≥ 1, r ≥ 1, and m ≥ 2. We show that the graph Tn⊙rPm, n ≥ 1, r ≥ 1, and m ≥ 2, has a super 1-face antimagic total labeling and the graph Tn⊙rP2, n ≥ 1, r ≥ 1, has a super d-face antimagic total labeling for d ϵ {3,5,7,9}.