Abstract
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 (∆(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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.