ON SUPER (a, d)- -ANTIMAGIC TOTAL LABELING OF STAR GRAPH K1,n

Abstract

Let ( ) and ( ) be simple and finite graphs, and be a subgraph of . Let | | | | | | dan | | . Covering of is a family of different subgraphs such that every edge in belongs to at least one of subgraph . If isomorphic to , then admits an -Covering. An - -antimagic total labeling of is bijection , such that for all subgraphs of isomorphic to , the weights ∑ ∑ . Constitute an arithmetic progression where and are positive integer and is the number of subgraphs of isomorphic to , maka . Additionally, the labeling is called a super - -antimagic total labeling if ( ) . The star graph admit super - - antimagic total labeling. If the star graph , , is super - - antimagic, then .