BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv5.3.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://aarms.math.ca
X-WR-CALDESC:Events for 
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20240117T153000
DTEND;TZID=UTC:20240117T163000
DTSTAMP:20260609T054200
CREATED:20240110T181847Z
LAST-MODIFIED:20240110T182517Z
UID:7474-1705505400-1705509000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Speaker:  Leslie Hogben\, Iowa State University\nTitle:         Forts\, (fractional) zero forcing\, and Cartesian products of graphs\n\nAbstract: Zero forcing is an iterative process that repeatedly applies a rule to change the color of vertices of a graph $G$ from white to blue. The  zero forcing number is the minimum number of initially blue vertices that are needed to color all vertices blue through this process.  Standard zero forcing was introduced about fifteen years ago  in the control of quantum systems and as an upper bound for  maximum multiplicity of an eigenvalue (or maximum nullity) among matrices having off-diagonal nonzero pattern described by the edges of the graph $G$\, and rediscovered later both as part of power domination and as fast-mixed graph searching.\n\nWhether a set is a zero forcing set can be tested using a certain type of set called a fort\, which obstructs zero forcing.   The maximum number of disjoint forts (fort number)  provides another  lower bound for the zero forcing number; results about fort number will be discussed.  Forts can be used in integer programs to determine the zero forcing number and fort number.  The relaxation of these integer programs leads to dual linear programs that define the fractional zero forcing number\, or equivalently\, the fractional fort number\, and results about these parameters will be discussed.\n\nThere is a well-known upper bound for the zero forcing number of a Cartesian product in terms of the zero forcing numbers and orders of the constituent graphs.  The question of a lower bound for the zero forcing number of a Cartesian product has recently been studied.  It is easy to see that there is a Vizing-like lower bound when the constituent graphs of the Cartesian product both have maximum nullity equal to zero forcing number.  Fractional zero forcing and fort number provide additional lower bounds on the the zero forcing number of a Cartesian product in terms of parameters of the constituent graphs.\n\n______________________________________________________________________________\nJeannette Janssen is inviting you to a scheduled Zoom meeting.\n\nTopic: Atlantic Graph Theory Seminar\nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09\n\nMeeting ID: 864 1523 0827\nPasscode: 835547
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-leslie-hogben/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette%20Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
END:VCALENDAR