589 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

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
0 votes
0 votes
1 answer
2
gagan55 asked Jun 30, 2023
192 views
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??
0 votes
0 votes
1 answer
3
Dhiraj_777 asked May 4, 2023
519 views
In a Connected Planar Bipartite Graph of order 10 atmost how many edges be present ?
0 votes
0 votes
1 answer
4
Sahil_Lather asked Apr 15, 2023
479 views
Graph G is obtained by adding vertex s to $K_{3,4}$ and making s adjacent to every vertex of $K_{3,4}$ .The find the minimum number of colours required ot edge-colour is ...