On the local vertex antimagic total coloring of some families tree

Let G(V,E) be a graph of vertex set V and edge set E. Local vertex antimagic total coloring developed from local edge and local vertex antimagic coloring of graph. Local vertex antimagic total coloring is defined f: V(G) boolean OR E(G) -> {1,2,3...,vertical bar V(G)vertical bar + vertical bar E(G)vertical bar} if for any two adjacent vertices v(1) and v(2), w(v1) not equal w(v2), where for v is an element of G, w(v) = Sigma c subset of E(v) f(e) + f(v), where E(v) and V (v) are respectively the set of edges incident to v and the set of vertices adjacent to v. Thus, any local vertex antimagic total coloring induces a proper vertex coloring of G if each vertex v is assigned the color w(v). The chromatic number of local vertex antimagic total coloring denote chi(lvat)(G) is the minimum number of colors taken over all colorings induced by local vertex antimagic total coloring of graph G. In this paper, we use some families tree graph. We also study the existence of local vertex antimagic total coloring chromatic number of some families tree namely star graph, double star graph, banana tree graph, centipede graph, and amalgamation of star graph.