The following pages link to A study of monopolies in graphs (Q367095):
Displayed 8 items.
- On dynamic monopolies of graphs: the average and strict majority thresholds (Q448965) (← links)
- On the complexity of reasoning about opinion diffusion under majority dynamics (Q785234) (← links)
- Bounding the open \(k\)-monopoly number of strong product graphs (Q1692650) (← links)
- Integer programming approach to static monopolies in graphs (Q1752610) (← links)
- Facets of the dynamic monopoly polytope: linear ordering formulation (Q2042076) (← links)
- Vector domination in split-indifference graphs (Q2281167) (← links)
- A polyhedral study of dynamic monopolies (Q2288851) (← links)
- The complexity of open k-monopolies in graphs for negative k (Q5106671) (← links)