# Number of non-isomorphic block graphs on n nodes

A block in a graph is a maximal connected subgraph that has no cut-vertex. A complete graph having $n$ nodes is denoted by $K_n$. A block graph is a graph in which each block is a complete graph. For example in figure a block graph with blocks $K_2,K_2,K_3,K_4$ and $K_5$. What is the number of non-isomorphic block graphs on $n$ nodes?.

• You mean, "What is the number of non-isomorphic block graphs on $n$ nodes?", right? – Alex Suciu May 14 '17 at 12:01
• Now I have edited it. – Ranveer Singh May 14 '17 at 13:02

## 1 Answer

This appears to be http://oeis.org/A035053 . References and formulae are there.