EISPN conjectures for Cartesian products of paths
Statement
Let denote the path of order , and let denote the Cartesian graph product. For a graph , let denote its efficient isolated private-neighborhood number.
EISPN path-product conjectures. If , then
If , then
These conjectures are posed from data for graph classes. The source gives no resolution; the first EISPN assertion is presented as an additional conjecture following the EIPN grid conjecture.
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.