ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Hm,mH_{m,m} be the finite truncated square tiling graph with m≥1m\geq 1, let γt,r(Hm,m)\gamma_{t,r}(H_{m,m}) denote its (t,r)(t,r) broadcast domination number, and let mm and rr be positive integers. Single-vertex broadcast conjecture. If m≥1m\geq 1 and r≥1r\geq 1, then γt,r(Hm,m)=1\gamma_{t,r}(H_{m,m})=1 provided

t={r+2m+1if m is even,r+2m+2if m is odd.t=\begin{cases} r+2m+1 & \text{if $m$ is even},\\ r+2m+2 & \text{if $m$ is odd}. \end{cases}

This predicts the largest square finite graphs admitting a single broadcasting vertex for the specified parameters, based on the authors' experiments. No proof or resolution is supplied in the source.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.