1436568

Appears in sequences

• Number of connected labeled graphs with n edges and n nodes.at n=7A057500
• Triangle read by rows: T(n,m) = number of graphs on n labeled nodes, with m components of size = order. Also number of graphs on n labeled nodes with m unicyclic components.at n=28A106239
• Triangular array T(n,k) giving number of connected graphs with n labeled nodes and k edges (n >= 1, n-1 <= k <= n(n-1)/2).at n=43A123527
• Triangle read by rows: T(n,k) is the number of labeled connected planar graphs on n vertices and k edges.at n=33A288265
• Triangle read by rows: T(n,k) is the number of connected labeled graphs with n edges and k vertices, 1 <= k <= n+1.at n=43A343088