Question

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 3 points. The degree of a point is the number of edges
connected to it. For example, a triangle is a graph with three points of degree 2 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 condition___.
(1) 11 ≤ e ≤ 66
(2) 10 ≤ e ≤ 66
(3) 11 ≤ e ≤ 65
(4) 0 ≤ e ≤ 11

Answer 1

Thank you for asking this question. Here is your answer:

Let us consider, there are two points then only one line can pass through these two points.

If we consider three points then minimum number of edges is 2 and maximum number of edges is three.

Thus, minimum number of edges with 12 points can be 11 and maximum can be 16.

Hence, 11 ≤ e ≤ 66

If there is any confusion please leave a comment below.