Adjacent Vertex Distinguishing Total Coloring of Corona Product of Graphs

arXiv2208.10884MaRDI QIDQ6408567FDOQ6408567

Authors: Hanna Furmańczyk, Rita Zuazua 

Publication date: 23 August 2022

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, where the color set at a vertex $v$, $C_f^G(v)$, is $f(v)cupf(vu)|uinV(G),vuinE(G)$. 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.

This page was built for publication: Adjacent Vertex Distinguishing Total Coloring of Corona Product of Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6408567)