in Graph Theory
600 views
0 votes
0 votes
Consider G be a directed graph whose vertex set is a set number from 2 to 120. There is an edge from vertex a to vertex b if b = k * a. Where k is any natural number. Then the number of connected components are___________.

How to proceed with such questions
in Graph Theory
by
600 views

4 Comments

  yeah got the same

0
0

why u considerd numbers <=60 as connected??

am not getting this part;

i thought all prime nos will be taken as a different component!

@Prateek Raghuvanshi

@Magma 

0
0
edited by

@Gate Fever Because of look at the condition carefully b = k * a; where k is any NATURAL NUMBER (clearly given). Hence all the prime numbers less than 60 will get paired for example.

31 will get paired with 62 (by considering b = k * a.

Similarly, for other prime numbers, less than 60 all will get paired.

1
1

Please log in or register to answer this question.

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