Revisiting $d$-distance (independent) domination in trees and in bipartite graphs

TL;DR

This paper extends the understanding of $d$-distance domination in trees and bipartite graphs, proving new bounds, characterizing extremal cases, and generalizing previous conjectures and theorems.

Contribution

It proves that the $d$-distance $1$-packing domination number bound holds for bipartite graphs, characterizes extremal trees, and extends Favaron's theorem with new bounds based on leaves.

Findings

Bound $rac{n}{d+1}$ for bipartite graphs.

Characterization of trees where $rac{n}{d+1}$ bound is tight.

Extended bounds involving the number of leaves in trees.

Abstract

The $d$-distance $p$-packing domination number $\gamma_d^p(G)$ of $G$ is the minimum size of a set of vertices of $G$ which is both a $d$-distance dominating set and a $p$-packing. In 1994, Beineke and Henning conjectured that if $d\ge 1$ and $T$ is a tree of order $n \geq d+1$, then $\gamma_d^1(T) \leq \frac{n}{d+1}$. They supported the conjecture by proving it for $d\in \{1,2,3\}$. In this paper, it is proved that $\gamma_d^1(G) \leq \frac{n}{d+1}$ holds for any bipartite graph $G$ of order $n \geq d+1$, and any $d\ge 1$. Trees $T$ for which $\gamma_d^1(T) = \frac{n}{d+1}$ holds are characterized. It is also proved that if $T$ has $\ell$ leaves, then $\gamma_d^1(T) \leq \frac{n-\ell}{d}$ (provided that $n-\ell \geq d$), and $\gamma_d^1(T) \leq \frac{n+\ell}{d+2}$ (provided that $n\geq d$). The latter result extends Favaron's theorem from 1992 asserting that $\gamma_1^1(T) \leq \frac{n+\ell}{3}$. In both cases, trees that attain the equality are characterized and relevant conclusions for the $d$-distance domination number of trees derived.