Protection number conjecture for Cartesian products with K_2
Statement
Let be the path graph on vertices, the cycle graph on vertices, and the complete graph on two vertices. For a graph , let denote its protection number.
Protection number conjecture. For any integer ,
Furthermore, for ,
This conjecture proposes exact protection numbers for Cartesian products of paths and cycles with the complete graph of order two, a case not covered by the preceding result. Its status is unresolved in the supplied source context.
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.