Bissoy.com
Doctors Medicines MCQs Q&A

If G is the forest with 54 vertices and 17 connected components, G has _______ total number of edges.

If G is the forest with 54 vertices and 17 connected components, G has _______ total number of edges. Correct Answer 37

Here we are given a forest with 54 vertices and 17 components. A component is itself a tree and since there are 17 components means that every component has a root, therefore we have 17 roots. Each new vertex of the forest contributes to a single edge to a forest. So for remaining 54-17 = 37 vertices we can have m-n=37 edges. Hence, answer is 37.

Related Questions

Consider the following statements: 1. As per recent amendment to the Indian Forest Act, 1927, forest dwellers have the right to fell the bamboos grown on forest areas. 2. As per the Scheduled Tribes and Other Traditional Forest Dwellers (Recognition of Forest Rights) Act, 2006, bamboo is a minor forest produce. 3. The Scheduled Tribes and Other Traditional Forest Dwellers (Recognition of Forest Rights) Act, 2006 allows ownership of minor forest produce to forest dwellers. Which of the statement given above is/are correct?
Which of the following statements relating to the Scheduled Tribes and Other Traditional Forest Dwellers (Recognition of Forest Rights) Act, 2006 are correct? 1. The Act recognizes forest rights of forest dwelling Scheduled Tribes who have been occupying the forest land before October 25, 1980. 2. The onus of implementation of the Act lies at the level of the State / UT Governments. 3. The Act seeks to recognize and vest certain forest rights in the forest dwelling Scheduled Tribes and other traditional forest dwellers. Select the correct answer using the code given below :
What is the number of vertices in an undirected connected graph with 39 edges, 7 vertices of degree 2, 2 vertices of degree 5 and remaining of degree 6?
Each of the question below consists of a question and three statements number I, II and III given below it. You have to decide whether the data provided in the statement are sufficient to answer the question. Two person X and Y together can make 25% of total number of bricks in 4.8 days. Another person Z can make 50 bricks in a day. What is the time taken by person X and Z together to make the total number of bricks? I. Dimensions of a brick is (3cm × 4cm × 5cm) while the dimension of a cuboids when all the bricks are put together is (72cm × 80cm × 50cm) and ratio of number of days taken by X and Y alone to make the total number of bricks is 3 : 2. II. The total number of bricks is 4800 and person Y can make 150 bricks in day. III. Total volume of all the bricks together is 1.008m3 and dimension of a bricks is (5cm × 6cm × 7cm) and time taken by Z to make total number of bricks is 200 % more than the total time taken by person Y to make total number of bricks.
Which of the following is/are not true for a triangular pyramid? (a) Triangular pyramid has six faces. (b) Triangular pyramid has four vertices. (c) Triangular pyramid has six edges. (d) The sum of the number of faces, vertices and edges of a triangular pyramid is 14. (e) Triangular pyramid is also known as a tetrahedron.
The number of faces, vertices and edges of a polyhydron A are x, 10 and 15, respectively and the number of faces, vertices and edges of a polyhydron B are 12, y and 30, respectively. What is the value of (x + y)?
Which of the following statements regarding tree are correct? (A) All the links of a tree together does not constitute the complement of the corresponding tree (B) A connected subgraph of a connected graph is a tree if there exist (n - 1) nodes of the group (C) A connected subgraph of a connected graph is a tree if there exist many paths between any pair of nodes in it (D) The number of terminal nodes of end vertices of every tree are atleast two (E) Every connected graph has atleast one tree Choose the correct answer from the options given below: (1) (A) and (B) only (2) (B) and (C) only (3) (B) and (D) only (4) (D) and (E) only
A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?
An undirected graph has 8 vertices labelled 1, 2, …,8 and 31 edges. Vertices 1, 3, 5, 7 have degree 8 and vertices 2, 4, 6, 8 have degree 7. What is the degree of vertex 8?
Which one of the following code is correct showing number of vertices, edges and Diameter for the given network ?     Vertices Edges Diameter A. 10 7 5 B. 10 10 7 C. 10 5 6 D. 10 8 7