On super --antimagic total labeling of disjoint union of cycles

Abstract

Let and be finite simple graphs where every edge of belongs to at least one subgraph that is isomorphic to . An --antimagic total labeling of a graph is a bijection such that for all subgraphs isomorphic to , the -weights, form an arithmetic progression where are two fixed integers and is the number of subgraphs of isomorphic to . Moreover, if the vertex set receives the minimum possible labels , then is called a super --antimagic total labeling. In this paper we study super --antimagic total labeling of a disconnected graph, namely .

Keywords

• super --antimagic total labeling
• disconnected graph
• disjoint union of cycles