Let G=(V(G),E(G)) be a connected simple graph with n vertices and m edges. A bijection f from the edge set of G to [m] is called a local antimagic labeling of G, if for any two adjacent vertices u and v in G, the sums of the weights of the edges associated with u and v ,respectively, are different. Similarly, A bijection g from the union of edge set and vertex set of G to [n+m] is called a local antimagic total labeling of G, if for any two adjacent vertices u and v in G, The sum of the weight of u and the weights of its incident edges differs from that of v. Obviously, any local antimagic (total) labeling induces a proper vertex-coloring of G when every vertex v is assigned the color w(v)(w_t(v)). The local antimagic (total) chromatic number of G, denoted by X_la(G)(X_lat(G)) , is defined as the minimum number of colors taken over all colorings induced by local antimagic (total) labelings of G. In this paper, we present the local antimagic (total) chromatic number of firecracker graph F_n,k, obtained by the concatenation of n k-stars by linking one leaf from each. Then we give the local antimagic chromatic number of the edge-corona product of two graphs G and H, where the graph is constructed by taking one copy of G and |E(G)| disjoint copies of H one-to-one assigned to each edge of G, and for every edge uv of G, joining u and v to every vertex of the copy of H associated to uv. For the graph studied here, G is a star S_k or a double star S_k1,k2, and H is an empty graph with r vertices or a complete graph K_2.