Discrete Mathematics MCQs | Page - 9
Dear candidates you will find MCQ questions of Discrete Mathematics here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.
M
Q. From 1, 2, 3, …, 320 one number is selected at random. Find the probability that it is either a multiple of 7 or a multiple of 3.
M
Q. If each and every vertex in G has degree at most 23 then G can have a vertex colouring of
M
Q. Berge graph is similar to due to strong perfect graph theorem.
M
Q. A is a graph which has the same number of edges as its complement must have number of vertices congruent to 4m or 4m modulo 4(for integral values of number of edges).
M
Q. In a the vertex set and the edge set are finite sets.
M
Q. If G is the forest with 54 vertices and 17 connected components, G has total number of edges.
M
Q. An undirected graph G has bit strings of length 100 in its vertices and there is an edge between vertex u and vertex v if and only if u and v differ in exactly one bit position. Determine the ratio of the chromatic number of G to the diameter of G?
M
Q. Triangle free graphs have the property of clique number is
M
Q. 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?
Jump to
Download our easy to use, user friendly Android App from Play Store. And learn MCQs with one click.
