A112442 Number of connected simple graphs with n vertices, n+7 edges, and vertex degrees no more than 4.

0, 0, 0, 0, 0, 0, 2, 35, 707, 11477, 146428, 1530906, 13663758, 107554370, 764873164, 5004170844, 30537798974, 175688807383, 960958921848, 5030916734826

Offset: 1

Author

Jonathan Vos Post, Dec 21 2005

Keywords

• nonn
• more

Links

• J. B. Hendrickson and C. A. Parks, Generation and Enumeration of Carbon skeletons, J. Chem. Inf. Comput. Sci., 31 (1991), 101-107. See Table 2, column 8 on page 103.
• Michael A. Kappler, GENSMI: Exhaustive Enumeration of Simple Graphs [gives different a(11)].

Crossrefs

The analogs for n+k edges with k = -1, 0, ..., 6 are: A000602, A036671, A112410, A112619, A112408, A112424, A112425, A112426. Cf. A121941.

Programs

nauty

for n in {7..13}; do geng -c -D4 ${n} $((n+7)):$((n+7)) -u; done # Andrey Zabolotskiy, Nov 24 2017

Extensions

New name, offset corrected, a(11) corrected, and a(14) added by Andrey Zabolotskiy, Nov 24 2017

a(15)-a(20) added by Georg Grasegger, Jun 05 2023