Mathematics MCQ Quiz Hub

Mathematics MCQs Set-3

Choose a topic to test your knowledge and improve your Mathematics skills

1. What is a star tree?




2. A polytree is called _______________




3. The tree elements are called __________




4. A linear graph consists of vertices arranged in a line.




5. Two labeled trees are isomorphic if ____________




6. A graph which consists of disjoint union of trees is called ______




7. What is a bipartite graph?




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




9. A binary cycle space forms a ______ over the two element field.




10. If G is a simple graph with n-vertices and n>=3, the condition for G has a Hamiltonian circuit is __________




11. What is a separable graph?




12. How many edges are there in a complete graph of order 9?




13. How many cycles are there in a wheel graph of order 5?




14. Topological sorting of a graph represents _______ of a graph.




15. A bridge can not be a part of _______




16. 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 _______




17. 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 ______




18. 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.




19. 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?




20. The minimum number of edges in a connected cyclic graph on n vertices is _____________




21. The maximum number of edges in a 8-node undirected graph without self loops is ____________




22. 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 _____




23. A graph which has the same number of edges as its complement must have number of vertices congruent to ______ or _______ modulo 4(for integral values of number of edges).




24. Every Isomorphic graph must have ________ representation.




25. A cycle on n vertices is isomorphic to its complement. What is the value of n?




26. How many perfect matchings are there in a complete graph of 10 vertices?




27. A graph G has the degree of each vertex is ≥ 3 say, deg(V) ≥ 3 ∀ V ∈ G such that 3|V| ≤ 2|E| and 3|R| ≤ 2|E|, then the graph is said to be ________ (R denotes region in the graph)




28. What is the grade of a planar graph consisting of 8 vertices and 15 edges?




29. A _______ is a graph with no homomorphism to any proper subgraph.




30. Which algorithm efficiently calculates the single source shortest paths in a Directed Acyclic Graph?




31. The _______ of a graph G consists of all vertices and edges of G.




32. A ______ in a graph G is a circuit which consists of every vertex (except first/last vertex) of G exactly once.




33. A trail in a graph can be described as ______________




34. Let a graph can be denoted as ncfkedn a kind of ____________




35. Determine the edge count of a path complement graph with 14 vertices.




36. The sum of an n-node graph and its complement graph produces a graph called _______




37. In a directed weighted graph, if the weight of every edge is decreased by 10 units, does any change occur to the shortest path in the modified graph?




38. Let G(V, E) be a directed graph where every edge has weight as either 1, 2 or 5, what is the algorithm used for the shortest path from a given source vertex to a given destination vertex to get the time complexity of O(V+E)?




39. The topological sorting of any DAG can be done in ________ time.




40. If there are more than 1 topological sorting of a DAG is possible, which of the following is true.




41. Which of the given statement is true?




42. What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph?




43. In which of the following does a Directed Acyclic Word Graph finds its application in?




44. What is time complexity to check if a string(length S1) is a substring of another string(length S2) stored in a Directed Acyclic Word Graph, given S2 is greater than S1?




45. In which of the following case does a Propositional Directed Acyclic Graph is used for?