On the fixing sets of dihedral groups

DOI10.1016/j.disc.2018.10.007zbMath1400.05208OpenAlexW2900920040WikidataQ128929709 ScholiaQ128929709MaRDI QIDQ1625814

L. K. Lauderdale

Publication date: 29 November 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.10.007

zbMATH Keywords

graphautomorphism groupdihedral groupfixing numberfixing set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Fixing numbers of graphs with symmetric and generalized quaternion symmetry groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automorphism group and fixing number of \((3,6)\)- and \((4,6)\)-fullerene graphs
• Rigidity and separation indices of graphs in surfaces
• Destroying automorphisms by fixing nodes
• Identifying graph automorphisms using determining sets
• Fixing numbers of graphs and groups
• Vertex-minimal graphs with dihedral symmetry. I.
• On the action of non-Abelian groups on graphs
• The least number of edges for graphs having dihedral automorphism group
• The classification of minimal graphs with given abelian automorphism group
• On the Hardness of Graph Isomorphism
• HOW TO DESCRIBE A GRAPH
• Fixing numbers for matroids

This page was built for publication: On the fixing sets of dihedral groups