McqMate
Sign In
Hamberger menu
McqMate
Sign in
Sign up
Home
Forum
Search
Ask a Question
Sign In
McqMate Copyright © 2024
→
Computer Science Engineering (CSE)
→
Discrete Mathematics
→
A graph is bipartite if and only if its ...
Q.
A graph is bipartite if and only if its chromatic number is ________.
A.
1
B.
2
C.
odd
D.
even
Answer» B. 2
1.8k
0
Do you find this helpful?
16
View all MCQs in
Discrete Mathematics
Discussion
No comments yet
Login to comment
Related MCQs
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?
The graph defined by the vertices and edges of a __________ is bipartite.
The chromatic number of the chess board is ______.
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).
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
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
In a graph if few edges have directions and few do not have directions then the graph is called _________.
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.
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
Berge graph is similar to due to strong perfect graph theorem.