Speaker
Delio Jaramillo Velez
(Virginia Tech)
Description
A connected dominating set of a graph is a vertex set that induces a connected subgraph and such that every vertex outside the set is adjacent to at least one vertex in the set. The minimum cardinality of a connected dominating set is called the connected domination number. We present an algebraic expression for this combinatorial invariant using the theory of binomial edge ideals.
Authors
Delio Jaramillo Velez
(Virginia Tech)
Dr
Lisa Seccia
(University of Neuchâtel)