论文标题
通过某些图形操作获得的图形的抗原方向问题
The antimagic orientation problems for graphs obtained by some graph operations
论文作者
论文摘要
如果存在$ g $的方向以及从$ e（g）$到$ \ {1,2，\ ldots，| e（g）| \} $从$ e（g）$到$ e（g）$的边缘和两次射击，则可以承认一个简单的图$ g $承认一个抗刺激取向。减去到顶点的外边缘。它是由Hefetz，Mütze和Schwartz〜 \ Cite {HMS10}猜想的，每个连接的简单图都允许抗原方向。 在本文中，我们证明了Mycielski的结构和图形的电晕产品，具有某些条件的图形图表满足了上述猜想。
A simple graph $G$ is said to admit an antimagic orientation if there exist an orientation on the edges of $G$ and a bijection from $E(G)$ to $\{1,2,\ldots,|E(G)|\}$ such that the vertex sums of vertices are pairwise distinct, where the vertex sum of a vertex is defined to be the sum of the labels of the in-edges minus that of the out-edges incident to the vertex. It was conjectured by Hefetz, Mütze, and Schwartz~\cite{HMS10} in 2010 that every connected simple graph admits an antimagic orientation. In this paper, we prove that the Mycielski construction and the corona product for graphs with some conditions yield graphs satisfying the above conjecture.
