Abstract
An adjacent vertex distinguishing total -coloring of a graph is a proper total -coloring of such that no pair of adjacent vertices has the same color sets, where the color set at a vertex , , is . In 2005 Zhang et al. posted the conjecture (AVDTCC) that every simple graph has adjacent vertex distinguishing total -coloring. In this paper we confirm the conjecture for many coronas, in particular for generalized, simple and -coronas of graphs, not relating the results to particular graph classes.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.