Distinguishing coloring and its variants

Abstract: A $k$-coloring of vertices of a graph $G$ is said to be $k$-distinguishing if no nontrivial automorphism of the graph preserves all the color classes. The minimum positive integer $k$ needed to have a $k$-distinguishing coloring of a graph $G$ is called distinguishing number of $G$ and is denoted by $D(G)$. This coloring was introduced by Albertson and Collinns in 1996 (https://www.combinatorics.org/ojs/index.php/eljc/article/view/v3i1r18). There are more than 300 research articles in this area by now. I will discuss about distinguishing coloring of certain graphs and some of the variants of distinguishing coloring.

commutative algebraalgebraic topologycombinatorics

Audience: researchers in the topic

Applications of Combinatorics in Algebra, Topology and Graph Theory

Series comments: To get email notification of the upcoming talk in this series, please subscribe to the mailing list or contact one of the organizers. Please visit webinar webpage for information about forthcoming and previous webinars. Thank you!