The path extremal conjecture for conflict-free vertex-connection number
Statement
Let be a connected graph of order . The path extremal conjecture.
Here denotes the conflict-free vertex-connection number of , and is the path on vertices. The conjecture proposes that among connected graphs of a fixed order, the path has maximum conflict-free vertex-connection number. The surrounding results establish upper bounds for trees and connected graphs in terms of radius and order, but do not settle this extremal assertion.
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.