MS-24 Zero Forcing: Its Variations and Applications (Zero Forcing)

Organizers: Daniela Ferrero (Texas State University), Mary Flagg (University of St. Thomas), and Michael Young (Iowa State University)

Zero forcing was introduced as a graph theoretic tool for obtaining an upper bound on the maximum nullity of real symmetric matrices whose nonzero pattern of off-diagonal entries is defined by a given graph. The minimum rank problem was motivated by the inverse eigenvalue problem. Independently, zero forcing was introduced by mathematical physicists studying control of quantum systems. Zero forcing has yielded many interesting results in linear algebra. Even more connections have been discovered, modeling problems in disciplines as diverse as theoretical biology and electrical engineering. The goal of our mini-symposium is to provide a forum for researchers in different variations and applications of zero forcing to share ideas and learn of new techniques that will transfer across applications to advance the state of the art in many directions.

Speakers

Chassidy Bozeman, Zero forcing and power domination

Boris Brimkov, Connected zero forcing

Steve Butler, The Z_q variation of zero forcing

Joshua Carlson, Throttling for Variants of Zero Forcing

Randy Davila, Total Forcing Sets in Graphs

Daniela Ferrero, Power domination and zero forcing in interated line digraphs

Mary Flagg, Nordhaus-Gaddum Bounds for Power Domination

Veronika Furst, Zero forcing and power domination for tensor products of graphs

Tracy Hall, Maehara's Conjecture, the Delta Theorem, and the greedegree of a graph

Seth Meyer, Z sharp forcing