630 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

236
views
1 answers
1 votes
233
views
1 answers
0 votes
gagan55 asked Jun 30, 2023
233 views
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??
581
views
1 answers
0 votes
Dhiraj_777 asked May 4, 2023
581 views
In a Connected Planar Bipartite Graph of order 10 atmost how many edges be present ?
548
views
1 answers
0 votes
Sahil_Lather asked Apr 15, 2023
548 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 ?