The least number of edges for graphs having dihedral automorphism group

DOI10.1016/0012-365X(73)90036-8zbMath0263.05111OpenAlexW1970066599MaRDI QIDQ2561239

Gary Haggard

Publication date: 1973

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

Full work available at URL: https://doi.org/10.1016/0012-365x(73)90036-8

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (9)

On the fixing sets of dihedral groups ⋮ Smallest graphs with given automorphism group ⋮ Vertex-minimal graphs with dihedral symmetry. II ⋮ Vertex-minimal graphs with dihedral symmetry. I. ⋮ Extremal edge problems for graphs with given hyperoctahedral automorphism group ⋮ Vertex-minimal planar graphs with a prescribed automorphism group ⋮ Vertex-minimal planar graphs with cyclic 2-group symmetry ⋮ Vertex-minimal graphs with nonabelian \(\mathbf{2}\)-group symmetry ⋮ A Stability Theorem for Minimum Edge Graphs with Given Abstract Automorphism Group

Cites Work

• The number of homeomorphically irreducible trees, and other species
• Extrema concerning asymmetric graphs
• The least number of edges for graphs having symmetric automorphism group

This page was built for publication: The least number of edges for graphs having dihedral automorphism group