Majority sets in graphs
چکیده(به انگلیسی؛ چکیدهی فارسی در دسترس نیست)
A set of vertices $S\subseteq V$ in a graph $G=(V,E)$ is called an internal majority set if for every vertex $v\in S$, a majority of the neighbors of $v$ are in $S$, or equivalently, every vertex $v\in S$ has fewer neighbors in $V-S=\overline{S}$ than it has in $S$. A set $S$ is called an external majority set if for every vertex $v\in\overline{S}$, a majority of the neighbors of $v$ are in $S$, or equivalently, every vertex $v\in\overline{S}$ has more neighbors in $S$ than it has in $\overline{S}$. A set of vertices $S\subseteq V$ in a graph $G=(V,E)$ is called a total majority set if for every vertex $v\in V$, a majority of the neighbors of $v$ are in $S$, or equivalently, every vertex $v\in V$ has more neighbors in $S$ than it has in $\overline{S}$. In this paper we show that majority sets in graphs are closely related to, but different than, a variety of sets that have been studied, such as offensive alliances, cost effective and very cost effective sets and unfriendly partitions in graphs. We also prove that the decision problems associated with external majority sets and total majority sets are NP-complete. Finally, we present a list of open problems related to majority sets in graphs.
نویسندگان و وابستگی سازمانی
- Mustapha Chellali — AMDA-RO Laboratory, Department of Mathematics, University of Blida, B.P. 270, Blida, Algeria
- Stephen Hedetniemi — Professor and Chair Emeritus of Computer Science, Clemson University, Clemson, SC 29634 USA
- Nacéra Meddah — AMDA-RO Laboratory, Department of Mathematics, University of Blida, B.P. 270, Blida, Algeria