Abstract
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.
Article PDF
Similar content being viewed by others
References
Albertson, M.O.: Distinguishing Cartesian powers of graphs. Electron. J. Comb. 12 (2005). Note 17 (Electronic)
Albertson, M.O., Boutin, D.L.: Distinguishing geometric graphs. J. Graph. Theory 53, 135–150 (2006)
Albertson, M.O., Boutin, D.L.: Using determining sets to distinguish Kneser graphs. Electron. J. Comb. 14(1) (2007). Research Paper 20 (Electronic)
Albertson, M.O., Collins, K.L.: Symmetry breaking in graphs. Electron. J. Comb. 3(1) (1996). Research Paper 18 (Electronic)
Bogstad, B., Cowen, L.J.: The distinguishing number of the hypercube. Discrete Math. 283(1–3), 29–35 (2004)
Boutin, D.L.: Identifying graph automorphisms using determining sets. Electron. J. Comb. 13(1) (2006). Research Paper 78 (Electronic)
Chan, M.: The distinguishing number of the direct product and the wreath product action. J. Algebr. Comb. 24, 331–335 (2006)
Chan, M.: The maximum distinguishing number of a group. Electron. J. Comb. 13 (2006). Research Paper 70 (Electronic)
Collins, K.L., Trenk, A.N.: The distinguishing chromatic number. Electron. J. Comb. 13(1) (2006). Research Paper 16 (Electronic)
Imrich, W., Klavzar, S.: Distinguishing Cartesian powers of graphs. J. Graph. Theory 53(3), 250–260 (2006)
Klavžar, S., Wong, T.-L., Zhu, X.: Distinguishing labellings of group action on vector spaces and graphs. J. Algebra 303(2), 626–641 (2006)
Klavzar, S., Zhu, X.: Cartesian powers of graphs can be distinguished with two labels. Eur. J. Comb. 28(1), 303–310 (2007)
Pach, J.: Finite point configurations. In: Handbook of Discrete and Computational Geometry, 2nd edn. Discrete Math. Appl., pp. 219–238. CRC, Boca Raton (2004)
Pach, J. (ed.): Towards a Theory of Geometric Graphs. Contemporary Mathematics, vol. 342. American Mathematical Society, Providence (2004)
Tymoczko, J.: Distinguishing numbers for graphs and groups. Electron. J. Comb. 11(1) (2004). Research Paper 63 (Electronic)
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Albertson, M.O., Boutin, D.L. Automorphisms and Distinguishing Numbers of Geometric Cliques. Discrete Comput Geom 39, 778–785 (2008). https://doi.org/10.1007/s00454-008-9066-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-008-9066-x