2 sequences : vertices and edges
Edwin Clark
eclark at math.usf.edu
Thu Sep 18 20:12:36 CEST 2003
On Thu, 18 Sep 2003, Yuval Dekel wrote:
> Let :
> a(n) = minimal number of vertices in a graph that has automorphism group
> isomorphic to the cyclic group C_n ,
ID Number: A058890
URL: http://www.research.att.com/projects/OEIS?Anum=A058890
Sequence: 1,2,9,10,15,11,14,14,15,17,22,18,26,16,21,22,34,17,38,25,23,
24,46,22,35,28,33,24,58,23,62,38,31,36,29,24,74,40,35,29,82,
25,86,32,27,48,94,30
Name: Smallest number of nodes in a graph whose automorphism group is
cyclic
of order n.
References William C. Arlinghaus, The classification of minimal graphs
with
given abelian automorphism group, Memoirs of the American
Mathematical Society, Number 330, September 1985.
F. Harary, Graph Theory, Page 176, Problem 14.7.
>
> b(n) = minimal number of edges in a graph that has automorphism group
> isomorphic to the cyclic group C_n .
>
> If I am not mistaken I once saw a(n) in the OEIS but I can't find it now .
>
> Does someone know the numbers a(n) and b(n) ? are both sequences in
> the OEIS ?
I couldn't find b(n).
More information about the SeqFan
mailing list