Bissoy.com
Doctors Medicines MCQs Q&A

If two cycle graphs Gm and Gn are joined together with a vertex, the number of spanning trees in the new graph is ______

If two cycle graphs Gm and Gn are joined together with a vertex, the number of spanning trees in the new graph is ______ Correct Answer m*n

As there are n possible edges to be removed from G and m edges to be removed from G and the rest from a spanning tree so the number of spanning tree in the new graph is m*n.

Related Questions

Let D be a simple graph on 10 vertices such that there is a vertex of degree 1, a vertex of degree 2, a vertex of degree 3, a vertex of degree 4, a vertex of degree 5, a vertex of degree 6, a vertex of degree 7, a vertex of degree 8 and a vertex of degree 9. What can be the degree of the last vertex?
The line graph L(G) of a simple graph G is defined as follows: There is exactly one vertex v(e) in L(G) for each edge e in G. For any two edges e and e' in G, L(G) has an edge between v(e) and v(e'), if and only if e and e' are incident with the same vertex in G. Which of the following statements is/are TRUE? (P) The line graph of a cycle is a cycle. (Q) The line graph of a clique is a clique. (R) The line graph of a planar graph is planar. (S) The line graph of a tree is a tree.
How many of the following statements are correct? i) All cyclic graphs are complete graphs. ii) All complete graphs are cyclic graphs. iii) All paths are bipartite. iv) All cyclic graphs are bipartite. v) There are cyclic graphs which are complete.
Let G be a directed graph whose vertex set is the set of numbers from 1 to 100. There is an edge from a vertex i to a vertex j if and only if either j = i + 1 or j = 3i. The minimum number of edges in a path in G from vertex 1 to vertex 100 is 
Let G be a directed graph whose vertex set is the set of numbers from 1 to 50. There is an edge from a vertex i to a vertex j if and only if either j = i + 1 or j = 3i. Calculate the minimum number of edges in a path in G from vertex 1 to vertex 50.
Six persons - Akshay, Bobby, Celina, Dimple, Esha, and Faisal took up a job with XYZ Consultants in a week from Monday to Saturday. Each of them joined for different posts on different days. The posts were of-Clerk, Officer, Technician, Manager, Supervisor and Sales Executive though not in the same order. Faisal joined as a Manager on the first day. Bobby joined as a Supervisor but neither on Wednesday nor Friday. Dimple joined as a Technician on Thursday. The officer joined the firm on Wednesday. Esha joined as a clerk on Tuesday. Akshay joined as a Sales Executive. Who joined the firm on Wednesday?
Consider the with different types of trees. Sohan has different types of trees in the field which are given in the table below: Names of trees Number of trees Neem ||| Papaya |||| Mango |||| || Coconut |||| Guava ||| Using the table, answer the question Neem, Papaya and Mango trees together is how many more than Coconut and Guava trees together?
A person wants to visit some places. He starts from a vertex and then wants to visit every vertex till it finishes from one vertex, backtracks and then explore other vertex from same vertex. What algorithm he should use?
One-sixth of the trees in a garden are neem trees. Half of the trees are Ashoka trees and the remaining are eucalyptus trees. If the number of neem trees is five, then how many eucalyptus trees are there in the garden?
A number of trees are arranged in 3 rows such that the number of trees in each row is co-prime and the product of the number of trees in first two rows is 551 and the product of the number of trees in last two rows is 1073. How many trees were there in the garden?