Conjecture on single-vertex broadcasts in square truncated tiling graphs
Statement
Let be the finite truncated square tiling graph with , let denote its broadcast domination number, and let and be positive integers. Single-vertex broadcast conjecture. If and , then provided
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.