ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph, and let D′(G)D'(G) denote its distinguishing index and OD′−(G)OD'^-(G) its negative oriented distinguishing index.

Conjecture for distinguishing index two. If

D′(G)=2,D'(G)=2,

then

OD′−(G)=1.OD'^-(G)=1.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.