Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree
We consider a non-monotone activation process $(X_t)_{t\in\{ 0,1,2,\ldots\}}$ on a graph $G$, where $X_0\subseteq V(G)$, $X_t=\{ u\in V(G):|N_G(u)\cap X_{t-1}|\geq \tau(u)\}$ for every positive integer $t$, and $\tau:V(G)\to \mathbb{Z}$ is a threshold function. The set $X_0$ is a so-called non-monot...
Main Authors: | Julien Baste, Stefan Ehard, Dieter Rautenbach |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2022-05-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/6844/pdf |
Similar Items
-
On the maximum number of minimum total dominating sets in forests
by: Michael A. Henning, et al.
Published: (2019-01-01) -
On the Complexity of Digraph Colourings and Vertex Arboricity
by: Winfried Hochstättler, et al.
Published: (2020-01-01) -
Packing chromatic vertex-critical graphs
by: Sandi Klavžar, et al.
Published: (2019-02-01) -
List-antimagic labeling of vertex-weighted graphs
by: Zhanar Berikkyzy, et al.
Published: (2021-12-01) -
Fooling-sets and rank
by: Friesen, Mirjam, et al.
Published: (2015)