When is a graph said to be bipartite

Home / Data Structure / Miscellaneous On Data Structures / Question

Examveda

When is a graph said to be bipartite?

A. If it can be divided into two independent sets A and B such that each edge connects a vertex from to A to B

B. If the graph is connected and it has odd number of vertices

C. If the graph is disconnected

D. If the graph has at least n/2 vertices whose degree is greater than n/2

Answer: Option A

Related Questions on Miscellaneous on Data Structures

A. Array

B. Linked List

C. Stack

D. Queue

View Answer

A. For implementing a stack-based algorithm

B. To maintain a balanced binary tree

C. For efficient sorting of elements

D. To test membership in a large dataset

View Answer

A. Queue

B. Stack

C. Heap

D. Array

View Answer

A. Array

B. Hash Map

C. Trie

D. Array

View Answer