On Super (a,d)-edge antimagic total labeling of branched-prism graph

Abstract

Let <em>H</em> be a branched-prism graph, denoted by <em>H</em> = (<em>C<sub>m</sub></em> x <em>P</em><sub>2</sub>) ⊙ Ǩ<sub>n</sub> for odd <em>m</em>, <em>m</em> ≥ 3 and <em>n</em> ≥ 1. This paper considers about the existence of the super (<em>a</em>,<em>d</em>)-edge antimagic total labeling of <em>H</em>, for some positive integer <em>a</em> and some non-negative integer <em>d</em>.