Abstract Let G=(V, E) be a graph that represents an underlying network. Let τ (resp. p) be an
assignment of non-negative integers as thresholds (resp. incentives) to the vertices of G. The …

Given a graph $ G $ with a vertex threshold function $\tau $, consider a dynamic process in
which any inactive vertex $ v $ becomes activated whenever at least $\tau (v) $ of its …

We consider the problem of keeping under control the spread of harmful items in networks,
such as the contagion proliferation of diseases or the diffusion of fake news. We assume the …

We study the problem of deciding reconfigurability of target sets of a graph. Given a graph G
with vertex thresholds τ, consider a dynamic process in which vertex v becomes activated …

Baker and Norine initiated the study of graph divisors as a graph-theoretic analogue of the
Riemann-Roch theory for Riemann surfaces. One of the key concepts of graph divisor theory …

Vaccination is the primary intervention for controlling the spread of infectious diseases. A
certain level of vaccination rate (referred to as" herd immunity'') is needed for this …