0 0 votes A graph may be defined as a set of points connected by lines called edges. Every edge connects a pair of points. Thus, a triangle is a graph with $3$ edges and three points. The degree of the point is the number of edges connected to it. For example, A triangle is a graph with three points of $2$ degree each. Consider a graph with $12$ points. It is possible to reach any point from any other point through a sequence of edges. The number of edges, $e,$ in the graph must satisfy the condtion $11 \leq e \leq 66$ $10 \leq e \leq 66$ $11 \leq e \leq 65$ $0 \leq e \leq 11$ Quantitative Aptitude cat2003-1 quantitative-aptitude graphs + – go_editor 14.2k points 1.0k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.