CAT Quantitative Ability Questions | CAT Permutation, Combination and Probability questions
CAT/2003
Question . 30
A graph may be defined as a set of points connected by lines called edges. Every edge connects a pair of points. Thus, a triangleis 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 agraph with three points of degree 2 each. Consider a graph with 12 points. It is possible to reach any point from any other pointthrough a sequence of edges. The number of edges, e, in the graph must satisfy the condition
View Answer
Explanatory Answer
Method of solving this CAT Quantitative Ability Question from Permutation, Combination and Probability question
(a) There are 12 points. Since they can be reached fromany other point, the edges will be 12C2 = 66. Also theminimum number of edges will be 11.