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:69cf1bb5c621c
DTSTART;TZID=America/Toronto:20240603T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240603T123000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-wei-wang
SUMMARY:Algebraic Graph Theory - Wei Wang
CLASS:PUBLIC
DESCRIPTION:TITLE: Which graphs are determined by their total numbers of w
 alks?\n\nSPEAKER:\n Wei Wang\n\nAFFILIATION:\n Xi'an Jiaotong University\n
 \nLOCATION:\n Please contact Sabrina Lato for the Zoom link.\n\nABSTRACT:
  Walks and closed-walks are ubiquitous in graph theory\,\nwhich capture l
 ots of important structural information of graphs. In\nthis talk\, we shal
 l consider the question in the title. The same\nquestion for closed walks 
 is precisely the problem of spectral\ncharacterizations of graphs. We show
  that for most graphs\, the number\nof walks determines the generalized sp
 ectrum of graphs and vice versa.\nThen the above question is equivalent to
  the problem of generalized\nspectral characterizations of graphs\, a topi
 c which has been studied\nextensively in recent years. Some simple criteri
 ons are provided for\ngraphs G to be determined by their total number of w
 alks\, based on\nsome recent results on the generalized spectral character
 izations of\ngraphs. Numerical results are also provided to illustrate the
 \neffectiveness of the proposed method. This is a joint work with\nWeifang
  Lv\, Finjin Liu and Wei Wang.
DTSTAMP:20260403T014525Z
END:VEVENT
END:VCALENDAR