the way of matching the verticles is called
Answers
Answered by
0
Answer:
Step-by-step explanation:
In the mathematical discipline of graph theory, a matching or independent edge set in an undirected graph is a set of edges without common vertices. Finding a matching in a bipartite graph can be treated as a network flow problem.
please like , brainlist and follow
Similar questions