The least number of edges for graphs having symmetric automorphism group*

https://doi.org/10.1016/S0021-9800(68)80046-8Get rights and content
Under an Elsevier user license
open archive

Abstract

The least (and greatest) number of edges realizable by a graph having n vertices and automorphism group isomorphic to Sm, the symmetric group of degree m, is determined for all admissible n.

Cited by (0)

*

Presented at “Combinatorics Conference” SIAM FALL MEETING University of California at Santa Barbara, November 29–30; December 1–2, 1967.

**

Part of this work was done while the author was a National Science Foundation Science Faculty Fellow at The City University of New York.

Copyright © 1968 Published by Elsevier Inc.