On the super -decomposition local antimagic total labeling of subdivision graph

Abstract

We assume that G = G(V, E) is a finite, simple, and undirected graph with V as set of vertices and E as set of edges. A bijection g : V (G) ∪ E(G) → {1, 2, 3, …|V(G)| + |E(G)} is called a super -decomposition local antimagic total labeling for any two adjacent subgraph and , , where . The chromatic number of super -decomposition local antimagic total labeling is minimum number of colors in super -decomposition local antimagic total labeling and denoted by . In this paper, we used some subdivision graph. Such as subdivision of star graph (S(Sn )), subdivision of sun graph (M(Mn )), subdivision of wheel graph (S(Wn )). The subdivision graph S(G) of a graph G is the graph obtained from G by replacing each of its edges by a path of length two.