Optimal Locating-Paired-Dominating Sets in King Grids

TL;DR

This paper investigates the minimal density of locating-paired-dominating sets in king grids, establishing bounds and constructing multiple LPDS with a specific density, thus advancing understanding of their structure in infinite graphs.

Contribution

It proves bounds on the minimal density of LPDS in king grids and constructs infinitely many LPDS with a particular density, partially confirming a conjecture.

Findings

Minimal density of LPDS in king grids is between 8/37 and 2/9.

Uncountably many LPDS with density 2/9 exist in king grids.

Results partially confirm the conjecture by Kinawi, Hussain, and Niepel.

Abstract

In this paper, we continue the study of locating-paired-dominating set, abbreviated LPDS, in graphs introduced by McCoy and Henning. Given a finite or infinite graph $G=(V,E)$, a set $S\subset V$ is paired-dominating if the induced subgraph $G[S]$ has a perfect matching and every vertex in $V$ is adjacent to a vertex in $S$. The other condition for LPDS requires that for any distinct vertices $u,v \in V\backslash S$, we have $N(u)\cap S\neq N(v)\cap S$. Motivated by the conjecture of Kinawi, Hussain and Niepel, we prove the minimal density of LPDS in the king grid is between $8/37$ and $2/9$, and we find uncountable many different LPDS with density $2/9$ in the king grid. These results partially solve their conjecture.