For a graph G and p âˆˆ [0, 1], let Gp arise from G by deleting every edge mutually independently with probability 1âˆ’ p. The random graph model (Kn)p is certainly the most investigated random graphâ€¦ (More)

For a graph G and a non-negative integral weight function w on the vertex set of G, a set S of vertices of G is w-safe if w(C) â‰¥ w(D) for every component C of the subgraph of G induced by S and everyâ€¦ (More)

A widely studied model for influence diffusion in social networks are target sets. For a graph G and an integer-valued threshold function Ï„ on its vertex set, a target set or dynamic monopoly is aâ€¦ (More)

For a graph G and an integer-valued threshold function Ï„ on its vertex set, a dynamic monopoly is a set of vertices of G such that iteratively adding to it vertices u of G that have at least Ï„(u)â€¦ (More)