a connected graph with 20 vertices contains 31 edges. without knowing which particular graph this is, what is the smallest and largest possible number of edges you can remove to get a spanning tree?
smallest number of edges to romove:
largest number of edges to remove:
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here