Discrete MathematicsVolume 6, Issue 1, September 1973, Pages 53-78The least number of edges for graphs having dihedral automorphism groupAuthor links open overlay panelGary HaggardShow moreShareCitehttps://doi.org/10.1016/0012-365X(73)90036-8Get rights and contentUnder an Elsevier user licenseopen archiveAbstractThe least (and greatest) number of edges realizable by a graph having n vertices and automorphism group isomorphic to D2m, the dihedral group of order 2m, is determined for all admissible n.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1973 Published by Elsevier B.V.
