Paper detail

Some Comments on the Slater number

Let $G$ be a graph with degree sequence $d_1\geq \ldots \geq d_n$. Slater proposed $s\ell(G)=\min\{ s: (d_1+1)+\cdots+(d_s+1)\geq n\}$ as a lower bound on the domination number $γ(G)$ of $G$. We show that deciding the equality of $γ(G)$ and $s\ell(G)$ for a given graph $G$ is NP-complete but that one can decide efficiently whether $γ(G)>s\ell(G)$ or $γ(G)\leq \left(\left\lceil\ln \left(\frac{n(G)}{s\ell(G)}\right)\right\rceil+1\right)s\ell(G)$. For real numbers $α$ and $β$ with $α\geq \max\{ 0,β\}$, let ${\cal G}(α,β)$ be the class of non-null graphs $G$ such that every non-null subgraph $H$ of $G$ has at most $αn(H)-β$ many edges. Generalizing a result of Desormeaux, Haynes, and Henning, we show that $γ(G)\leq (2α+1)s\ell(G)-2β$ for every graph $G$ in ${\cal G}(α,β)$ with $α\leq \frac{3}{2}$. Furthermore, we show that $γ(G)/s\ell(G)$ is bounded for graphs $G$ in ${\cal G}(α,β)$ if and only if $α<2$. For an outerplanar graph $G$ with $s\ell(G)\geq 2$, we show $γ(G)\leq 6s\ell(G)-6$. In analogy to $s\ell(G)$, we propose $s\ell_t(G)=\min\{ s: d_1+\cdots+d_s\geq n\}$ as a lower bound on the total domination number. Strengthening results due to Raczek as well as Chellali and Haynes, we show that $s\ell_t(T)\geq \frac{n+2-n_1}{2}$ for every tree $T$ of order $n$ at least $2$ with $n_1$ endvertices.