Adjacent Vertex Distinguishing Total Coloring of Corona Product of Graphs

preprint2022arXivOpen access

Abstract

An adjacent vertex distinguishing total kk-coloring ff of a graph GG is a proper total kk-coloring of GG such that no pair of adjacent vertices has the same color sets, where the color set at a vertex vv, CfG(v)C^G_f(v), is {f(v)}∪{f(vu)∣u∈V(G),vu∈E(G)}\{f(v)\} \cup \{f(vu)|u \in V (G), vu \in E(G)\}. In 2005 Zhang et al. posted the conjecture (AVDTCC) that every simple graph GG has adjacent vertex distinguishing total (Δ(G)+3)(Δ(G)+3)-coloring. In this paper we confirm the conjecture for many coronas, in particular for generalized, simple and ll-coronas of graphs, not relating the results to particular graph classes.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.