The directed Antimagic Graph Conjecture
Statement
Let be a connected directed graph. An antimagic labeling is an edge labeling in which each label is a distinct element of and the oriented sums at the vertices are pairwise distinct, where an oriented sum is the sum of labels on edges directed away from the vertex minus the sum of labels on edges directed towards it. Directed Antimagic Graph Conjecture. Every connected directed graph except for the directed graphs and admits an antimagic labeling. This directed analogue was suggested by Hefetz, Mütze, and Schwartz; the stated exceptions are the cyclic orientation of and the specified orientation of .
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.