[seqfan] Re: Counting simple graphs with node degree >=2

Richard J. Mathar mathar at mpia-hd.mpg.de
Wed Sep 16 15:34:20 CEST 2015


See http://list.seqfan.eu/pipermail/seqfan/2015-September/015292.html:

Prompted by Neil, Brendan McKay has come to the same conclusion
(priv. commun.) and contributed another variant in A261919 which allows graphs
to have more than one component (to be disconnected).
The first difference between A261919 and A004108 is at a(6), because on 6 nodes
we may have two disconnected triangles which individually fulfill the
requirements.

Richard Mathar


More information about the SeqFan mailing list