Pages that link to "Item:Q1270828"
From MaRDI portal
The following pages link to Size bounds for dynamic monopolies (Q1270828):
Displaying 9 items.
- Opinion Forming in Erdös-Rényi Random Graph and Expanders (Q5090994) (← links)
- A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$ (Q5135732) (← links)
- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis (Q5963653) (← links)
- Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree (Q6045404) (← links)
- The power of small coalitions under two-tier majority on regular graphs (Q6048435) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Maximum weighted induced forests and trees: new formulations and a computational comparative review (Q6071056) (← links)
- Target set in threshold models (Q6621268) (← links)
- Quasi-majority functional voting on expander graphs (Q6641063) (← links)