科研之友
微信
新浪微博
Facebook
分享链接
摘要
A geometric automorphism is an automorphism of a geometric graph that preserves crossings and noncrossings of edges. We prove two theorems constraining the action of a geometric automorphism on the boundary of the convex hull of a geometric clique. First, any geometric automorphism that fixes the boundary of the convex hull fixes the entire clique. Second, if the boundary of the convex hull contains at least four vertices, then it is invariant under every geometric automorphism. We use these results, and the theory of determining sets, to prove that every geometric n-clique in which n >= 7 and the boundary of the convex hull contains at least four vertices is 2-distinguishable.
- 出版日期2008-6
