Discrete Mathematics MCQs | Page - 10

Q. 91) Any subset of edges that connects all the vertices and has minimum total weight, if all the edge weights of an undirected graph are positive is called                

Q. 92) G is a simple undirected graph and some vertices of G are of odd degree. Add a node n to G and make it adjacent to each odd degree vertex of G. The resultant graph is              

Q. 93) 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.

Q. 94) 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?

Q. 95)              is the maximum number of edges in an acyclic undirected graph with k vertices.

Q. 96) The minimum number of edges in a connected cyclic graph on n vertices is

Q. 97) The maximum number of edges in a 8- node undirected graph without self loops is

Q. 98) Let G be an arbitrary graph with v nodes and k components. If a vertex is removed from G, the number of components in the resultant graph must necessarily lie down between            and            

Q. 99) The 2n vertices of a graph G corresponds to all subsets of a set of size n, for n>=4. Two vertices of G are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of connected components in G can be                        

Q. 100) If in sets A, B, C, the set B ∩ C consists of 8 elements, set A ∩ B consists of 7 elements and set C ∩ A consists of 7 elements then the minimum element in set A U B U C will be?