BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d37bde457f1
DTSTART;TZID=America/Toronto:20210301T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210301T113000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-seminar-hamed-karami
SUMMARY:Algebraic Graph Theory Seminar - Hamed Karami
CLASS:PUBLIC
DESCRIPTION:TITLE: Perfect Colorings of the Generalized Petersen Graphs\n\
 nSpeaker:\n Hamed Karami\n\nAffiliation:\n Iran University of Science and 
 Technology\n\nZoom:\n Contact Soffia Arnadottir\n\nABSTRACT:\n\nFor a grap
 h G and an integer m\, a mapping T:V(G) -&gt; {1\,...\,m} is\ncalled a perfec
 t m-coloring with matrix A=(a_ij)\, i\,j \\in {1\,...\,m}\,\nif it is surj
 ective\, and for all i\,j\, for every vertex of color i\, the\nnumber of i
 ts neighbors of color j is equal to a_ij. There is another\nterm for this 
 concept in literature as \"equitable partition\". In this\ntalk\, we prese
 nt some important results about enumerating parameter\nmatrices of all per
 fect 2-colorings and perfect 3-colorings of\ngeneralized Petersen graphs G
 P(n\,k).
DTSTAMP:20260406T092446Z
END:VEVENT
END:VCALENDAR