Question 9
A connected graph is said to have an Eulerian path if it has zero or two vertices with odd degrees. Given the degree distribution of the two connected graphs, Graph-A and Graph-B, find if any of the graphs has the Eulerian path.
A connected graph is said to have an Eulerian path if it has zero or two vertices with odd degrees. Given the degree distribution of the two connected graphs, Graph-A and Graph-B, find if any of the graphs has the Eulerian path.
Only Graph A
Only Graph B
Both Graph A and Graph B
Neither of them