How to determine if a graph is bipartite or not?
Chromatic no.of graph = atmost 2
There is no odd-length cycle in the graph.
What is meant by ordered pair in case of a directed graph and unordered pair in case of an undirected graph?
This is undirected graph, How you represent an edge?
(A,B) = (B,A) ===> un-ordered pair.
it is directed graph, (A,B) means edge from A to B,
(B,A) means edge from B to A
those are not equal i.e., (A,B) ≠ (B,A) ===> edge representation is a ordered pair