flower graph

Let $G = (V,E)$ be an undirected graph composed of $n$ simple cycles in which each pair of cycles has exactly one vertex in common, the root vertex.

For example here is a flower graph with $n = 3$.

The number of cycles in a flower graph of size $n$ is