1
$\begingroup$

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?. enter image description here

Improve this question
$\endgroup$
2
  • $\begingroup$ You mean, "What is the number of non-isomorphic block graphs on $n$ nodes?", right? $\endgroup$
    – Alex Suciu
    Commented May 14, 2017 at 12:01
  • $\begingroup$ Now I have edited it. $\endgroup$
    – Ranveer Singh
    Commented May 14, 2017 at 13:02

1 Answer 1

Reset to default
5
$\begingroup$

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

Improve this answer
$\endgroup$

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .