AI 中文总结
本文针对含支配团的图，证明了Hefetz等人提出的“每个连通图都存在反魔法定向”的猜想成立，完善了反魔法定向领域的相关结论。
AI 中文摘要
具有m条边的图G若能对其边进行定向并双射标记为1到m，使得定向顶点和（入弧标签减去出弧标签）两两不同，则称其具有反魔法定向。Hefetz、Mütze和Schwartz提出猜想：每一个连通图都存在反魔法定向，我们证明了该猜想对每一个含支配团的图都成立。
英文摘要
A graph G with m edges has an antimagic orientation if its edges can be oriented and bijectively labelled 1, ..., m so that the oriented vertex sums, the labels on in-arcs minus the labels on out-arcs, are pairwise distinct. Hefetz, Mütze and Schwartz conjectured that every connected graph admits an antimagic orientation. We prove that this conjecture holds for every graph with a dominating clique.
Comments6 pages, 1 figure
