title: Possibility Number of Biconnected components greater than number of vertices?
body: <p>This might sound silly but is it possible to have a case where the number of Biconnected components of graph are greater than number of vertices in the graph?</p>
  
  <p>I believe it is not possible and can quickly be validated with small graphs. </p>
  
  <p>Here's a basic logical attempt on why it's not possible
  From intuition, if we keep adding edges to a graph in hope that it will increase the number of Biconnected components, it will on contrary decrease the number of components as it will connect more components which were previously not connected.
  Leading to, the max number of Biconnected Components can be obtained from a tree like structured graph(because it has min. number of edges while staying connected) (assuming each of the edge is counted as a biconnected component). In a tree the max number of edges can be n-1, where n is the number of vertices and which leads to claim that </p>
  
  <p>"<em>The max. number of Biconnected Components will be n-1 for any graph</em>"</p>
  
  <p>Can someone help me validate this proposition, please?</p>