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 of 3 edges and 3 points. The degree of a point is the number of edges connected to it. For, example, a triangle is a graph with 3 points of degree 2 each. Consider a graph with 12 points. It is possible to reach any point from any through sequence of edges. The number of edges 'e' in the graph must satisfy the condition	Answers:
A) 11 ≤ e ≤ 66	B) 10 ≤ e ≤ 66	C) 11 ≤ e ≤ 65	D) 0 ≤ e ≤ 11	E) None
Explanation :   The least number of edges will be when one point is connected to each of the other 11 points, giving a total of 11 lines. One can move from any point to any other point via the common point.   The maximum edges will be when a line exists between any two points. Two points can be selected from 12 points in 12C2 i.e. 66 lines.   11 ≤ e ≤ 66nswer : 11 ≤ e ≤ 66
<result>A</result>
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 of 3 edges and 3 points. The degree of a point is the number of edges connected to it. For, example, a triangle is a graph with 3 points of degree 2 each. Consider a graph with 12 points. It is possible to reach any point from any through sequence of edges. The number of edges 'e' in the graph must satisfy the condition