Local Distance Antimagic Chromatic Number for the Union of Star and Double Star Graphs

Let G=(V,E) be a graph on p vertices without isolated vertices. A bijection f from V to {1, 2, . . . ,p} is called a local distance antimagic labeling if, for any two adjacent vertices u and v, we get distinct weights (colors), where a vertex x has the weight w(x) = sigma v epsilon N(x)f(v). The local distance antimagic chromatic number chi lda (G) is defined as the least number of colors used in any local distance antimagic labeling of G. We determine the local distance antimagic chromatic number for the disjoint union of t copies of stars and double stars.