English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we continue the study of locating-paired-dominating set,abbreviated LPDS, in graphs introduced by McCoy and Henning. Given a finite orinfinite graph $G=(V,E)$, a set $S\subset V$ is paired-dominating if theinduced subgraph $G[S]$ has a perfect matching and every vertex in $V$ isadjacent to a vertex in $S$. The other condition for LPDS requires that for anydistinct 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 minimaldensity of LPDS in the king grid is between $8/37$ and $2/9$, and we finduncountable many different LPDS with density $2/9$ in the king grid. Theseresults partially solve their conjecture.

Optimal Locating-Paired-Dominating Sets in King Grids