graph theory connectivity 
This cut induced confuses me.... I dont really understand what it is saying...

I am not understanding what connectivity is in graph theory. I thought connectivity is when you have a tree because all the vertices are connected but the above mentions something weird like components could someone please explain what they are and what connectivity really is?

Yes, a tree is, in particular, a connected graph - one in which every pair of vertices can be connected by exactly one simple path (i.e. a path with no repeated vertices). A connected graph is something more general - it is simply one in which every pair of vertices can be connected by at least one (simple) path.
