Automorphisms and distinguishing numbers of geometric cliques

DOI10.1007/s00454-008-9066-xzbMath1155.05048OpenAlexW2075168616MaRDI QIDQ938315

Michael O. Albertson, Debra L. Boutin

Publication date: 19 August 2008

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-008-9066-x

zbMATH Keywords

Convex hull boundaryDetermining setDistinguishing numberGeometric automorphismGeometric clique

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (max. 100)

Diameters and automorphism groups of inclusion graphs over nilpotent groups ⋮ The full automorphism groups, determining sets and resolving sets of coprime graphs ⋮ Determining sets, resolving sets, and the exchange property ⋮ The determining number of a Cartesian product

Cites Work

• The distinguishing chromatic number
• Cartesian powers of graphs can be distinguished by two labels
• Identifying graph automorphisms using determining sets
• Using determining sets to distinguish Kneser graphs
• The distinguishing number of the hypercube
• Distinguishing numbers for graphs and groups
• Symmetry breaking in graphs
• The maximum distinguishing number of a group
• The distinguishing number of the direct product and wreath product action.
• Distinguishing labellings of group action on vector spaces and graphs
• Distinguishing geometric graphs
• Towards a Theory of Geometric Graphs
• Distinguishing Cartesian powers of graphs
• Distinguishing Cartesian powers of graphs

This page was built for publication: Automorphisms and distinguishing numbers of geometric cliques