A144529 Triangle read by rows: T(n,k) = number of edges in graph whose vertices are forests with n unlabeled nodes and degree <= k and in which two vertices are joined by an edge if the forests differ (up to isomorphism) by exactly one edge.
0, 0, 1, 0, 1, 2, 0, 2, 5, 6, 0, 2, 9, 13, 14, 0, 3, 18, 32, 36, 37, 0, 3, 28, 67, 82, 87, 88
Offset: 1
Examples
Triangle begins: 0 0 1 0 1 2 0 2 5 6 0 2 9 13 14 0 3 18 32 36 37 0 3 28 67 82 87 88
Links
- Rebecca Neville, Graphs whose vertices are forests with bounded degree, Graph Theory Notes of New York, LIV (2008), 12-21. [Wayback Machine link]
Crossrefs
Cf. A144530.
Comments