Paired domination in graphs with minimum degree fourBujtás, Csilla (Avtor) Henning, Michael A. (Avtor) paired dominationboundsminimum degree fourA set $S$ of vertices in a graph $G$ is a paired dominating set if every vertex of $G$ is adjacent to a vertex in $S$ and the subgraph induced by $S$ admits a perfect matching. The minimum cardinality of a paired dominating set of $G$ is the paired domination number $\gamma_{pr}(G)$ of $G$. We show that if $G$ is a graph of order $n$ and $\delta(G) \ge 4$, then $\gamma_{pr}(G) \le 10n/17 < 0.5883n$.20262026-03-05 09:59:08Neznano27983UDK: 519.17ISSN pri članku: 0012-365XDOI: 10.1016/j.disc.2025.114923COBISS_ID: 270544131sl