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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d0a5e5ed1e1
DTSTART;TZID=America/Toronto:20240429T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240429T123000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-dmitriy-panasenko
SUMMARY:Algebraic Graph Theory - Dmitriy Panasenko
CLASS:PUBLIC
DESCRIPTION:TITLE: Deza graphs and vertex connectivity\n\nSPEAKER:\n Dmitri
 y Panasenko\n\nAFFILIATION:\n Umeå University\n\nLOCATION:\n Please conta
 ct Sabrina Lato for Zoom link.\n\nABSTRACT: A k-regular graph on v verti
 ces is called a Deza graph with\nparameters (v\, k\, b\, a)\, b ≥ a if t
 he number of common neighbors of\nany two distinct vertices takes two valu
 es: a or b. A Deza graph is\ncalled a strictly Deza graph if it has diamet
 er 2 and is not strongly\nregular.\n\nIn this talk we will discuss the enu
 meration of strictly Deza graphs\nand the enumeration of special subclass 
 of strictly Deza graphs called\ndivisible design graphs. We will also desc
 ribe the constructions of\ndivisible design graphs found during the enumer
 ation.
DTSTAMP:20260404T054717Z
END:VEVENT
END:VCALENDAR