Question: graph theory question. solve this question properly Question 7: Consider the following graph as a roadmap where edge as road and vertex as house. Do

graph theory question. solve this question properly
Question 7: Consider the following graph as a roadmap where edge as road and vertex as house. Do following (i, ii, iii) for the graph: b m f d 9 h Set minimum number of street camera to watch all roads. What is the minimum number? Set minimum number of street camera to watch all houses. What is the minimum number? Determine edge connectivity, vertex connectivity, minimum vertex cover, minimum edge cover, maximum independent set, maximum matching set in the above graph. Question 7: Consider the following graph as a roadmap where edge as road and vertex as house. Do following (i, ii, iii) for the graph: b m f d 9 h Set minimum number of street camera to watch all roads. What is the minimum number? Set minimum number of street camera to watch all houses. What is the minimum number? Determine edge connectivity, vertex connectivity, minimum vertex cover, minimum edge cover, maximum independent set, maximum matching set in the above graph
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
