The conjecture on negative oriented distinguishing index when the distinguishing index is two
Statement
Let be a connected graph, and let denote its distinguishing index and its negative oriented distinguishing index.
Conjecture for distinguishing index two. If
then
This is motivated by the preceding determination of the parameter for several graph classes and remains open. It concerns the values of the negative oriented distinguishing index for graphs whose distinguishing index equals two.
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.