Super -edge antimagic total labeling of a subclass of trees

Abstract

A graph labeling is a mapping that assigns numbers to graph elements. The domain can be the set of all vertices, the set of all edges or the set of all vertices and edges. A labeling in which domain is the set of vertices and edges is called a total labeling. For a graph with the vertex set and the edge set , a total labeling is called an -edge antimagic total labeling if the set of edge weights forms an arithmetic progression with initial term and common difference . An -edge antimagic total labeling is called a super -edge antimagic total labeling if the smallest labels are assigned to the vertices. In this paper, we investigate the super -edge-antimagic total labeling of a subclass of trees called subdivided stars for all possible values of , mainly .

Keywords

• super -eat labeling
• stars
• subdivided stars