M. Messinger

activity

20242026

collaborators

Showing 2025Show all

2 papers · 1 filter

math.CO2025

Discrete-time treatment number

N. E. Clarke, K. L. Collins, M. E. Messinger +2

We introduce the discrete-time treatment number of a graph, in which each vertex is in exactly one of three states at any given time-step: compromised, vulnerable, or treated. Our…

math.CO2025

Eulerian $k$ -dominating reconfiguration graphs

M. E. Messinger, A. Porter

For a graph $G$ , the vertices of the $k$ -dominating graph, denoted $D_{k} (G)$ , correspond to the dominating sets of $G$ with cardinality at most $k$ . Two vertices of $\math…

Discrete-time treatment number

Eulerian k-dominating reconfiguration graphs

Eulerian $k$ -dominating reconfiguration graphs