Advanced Search

A vertex of a graph = () is said to be by $M\subseteq V$ if the majority of the elements of the neighborhood of  (including itself) belong to . The set is a in if every vertex $i\in V$ is controlled by . Given a set $M\subseteq V$ and two graphs = ($V,E_1$) and = ($V,E_2$) where $E_1\subseteq E_2$, the consists of deciding whether there exists a sandwich graph = () (, a graph where $E_1\subseteq E\subseteq E_2$) such that is a monopoly in = (). If the answer to the is No, we then consider the , whose objective is to find a sandwich graph...

A vertex of a graph = () is said to be by $M\subseteq V$ if the majority of the elements of the neighborhood of  (including itself) belong to . The set is a in if every vertex $i\in V$ is controlled by . Given a set $M\subseteq V$ and two graphs = ($V,E_1$) and = ($V,E_2$) where $E_1\subseteq E_2$, the consists of deciding whether there exists a sandwich graph = () (, a graph where $E_1\subseteq E\subseteq E_2$) such that is a monopoly in = (). If the answer to the is No, we then consider the , whose objective is to find a sandwich graph...