in Quantitative Aptitude edited by
0 votes
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

  1. $11 \leq e \leq 66$
  2. $10 \leq e \leq 66$
  3. $11 \leq e \leq 65$
  4. $0 \leq e \leq 11$
in Quantitative Aptitude edited by
13.4k points

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true