**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 point through a sequence of edges. The number of edges, e, in the graph must satisfy the condition

11 ≤ e ≤ 66 | |

10 ≤ e ≤ 66 | |

11 ≤ e ≤ 65 | |

0 ≤ e ≤ 11 |

**Show Answer**

## CAT Quant Questions with Video Solutions

CAT Quant Questions Set 01CAT Quant Questions Set 02

CAT Quant Questions Set 03

CAT Quant Questions Set 04

CAT Quant Questions Set 05

CAT Quant Questions Set 06

Back to Main Page

#### CAT Quant Online Course

- 1000+ Practice Problems
- Detailed Theory of Every Topics
- Online Live Sessions for Doubt Clearing
- All Problems with Video Solutions

₹ 2999