Adjacent vertex distinguishing total coloring of corona products

An adjacent vertex distinguishing total k-coloring f of a graph G is a proper total k-coloring of G such that no pair of adjacent vertices has the same color sets. In 2005 Zhang et al. posted the conjecture (AVDTCC) that every simple graph G has adjacent vertex distinguishing total (Delta(G)+ 3)-coloring. In this paper we confirm the conjecture for many coronas, in particular for generalized, simple and l-coronas of graphs, not relating the results to particular graph classes. (C) 2023 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (https://creativecommons.org/licenses/by-nc-nd/4.0)