AVDTC of generalized 3-Halin graphs

In this paper, we prove that the adjacent vertex distinguishing total chromatic number of a generalized Halin graph with maximum degree 3 is 5. This result answers an open question of Chen and Zhang [11].