562 views
0 votes
0 votes
Please help with the following:-

1)How to determine if a graph is bipartite or not?

2)What is meant by ordered pair in case of a directed graph and unordered pair in case of an undirected graph?

1 Answer

Best answer
1 votes
1 votes

How to determine if a graph is bipartite or not?

Method 1:-

Chromatic no.of graph = atmost 2

 

Method 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

selected by

Related questions

1 votes
1 votes
1 answer
1
0 votes
0 votes
1 answer
2
gagan55 asked Jun 30, 2023
177 views
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??
0 votes
0 votes
1 answer
3
Dhiraj_777 asked May 4, 2023
488 views
In a Connected Planar Bipartite Graph of order 10 atmost how many edges be present ?
0 votes
0 votes
1 answer
4
Sahil_Lather asked Apr 15, 2023
439 views
Graph G is obtained by adding vertex s to $K_{3,4}$ and making s adjacent to every vertex of $K_{3,4}$ .The find the minimum number of colours required ot edge-colour is ...