Abstract: By constructing the edge-coloring and total-coloring algorithms based on the characteristic trees,  combined with combinatorial analysis, we obtain that the adjacent vertex distinguishing multiplicative edge chromatic number of Halin graphs is not more than 3, and the adjacent vertex distinguishing multiplicative total chromatic number of Halin graphs is 2. The  results show that the adjacent vertex distinguishing multiplicative 1-2-3 conjecture and multiplicative 1-2 conjecture are valid for Halin graphs, respectively.

Key words: multiplicative coloring, multiplicative 1-2-3 conjecture, multiplicative 1-2 conjecture, Halin graph