What Does It Mean For A Graph To Be Connected. A graph is connected if for all x y V G there exists a path from x to y using edges in E G. Hence if a graph G doesnt contain a directed path from u to v or from v to u for every pair of vertices u v then it is weakly connected.
We denote with VG and LG the set of vertices and the set of lines respectively. So the graph you speak would not be 2-connected. For a graph to be connected there must be at least one 1.
Jan 07 2010 A connected graph G is a collection of points called vertices and lines connecting all of them.
Dec 03 2011 If you have 3 points on a graph and you are interested in the area created by connecting the three points then it makes sense to connect them. A graph is said to be weakly connected if there doesnt exist any path between any two pairs of vertices. A graph is connected if for any two vertices xy VG there is a path whose endpoints are x and y. In short you have to have a reason for even plotting.
