BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Sajith P. (Indian Institute of Sciences)
DTSTART:20200722T053000Z
DTEND:20200722T063000Z
DTSTAMP:20260423T021238Z
UID:CATGT/2
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CATGT/2/">Di
 stinguishing coloring and its variants</a>\nby Sajith P. (Indian Institute
  of Sciences) as part of Applications of Combinatorics in Algebra\, Topolo
 gy and Graph Theory\n\n\nAbstract\nA $k$-coloring of vertices of a graph $
 G$ is said to be $k$-distinguishing if no nontrivial automorphism of the g
 raph preserves all the color classes. The minimum positive integer $k$  ne
 eded to have a $k$-distinguishing coloring of a graph $G$ is called distin
 guishing number of $G$ and is denoted by $D(G)$. This coloring was introdu
 ced by Albertson and Collinns in 1996 (https://www.combinatorics.org/ojs/i
 ndex.php/eljc/article/view/v3i1r18). There are more than 300 research arti
 cles in this area by now. I will discuss about distinguishing coloring of 
 certain graphs and some of the variants of distinguishing coloring.\n
LOCATION:https://researchseminars.org/talk/CATGT/2/
END:VEVENT
END:VCALENDAR