You must be logged in to see worked solutions.

Already have an account? Log in here.

Any connected group of things can be represented as a graph: cities and roads, people and friendships, and more. Learn why an even number of people have an odd number of friends.

In the graph above, is it possible to trace a path from node 4 to node 6?

You must be logged in to see worked solutions.

Already have an account? Log in here.

In the graph above, is is possible to trace a path from node 5 to node 4 that uses 3 or fewer edges?

You must be logged in to see worked solutions.

Already have an account? Log in here.

How many paths that do not repeat a node of length at most 4 (having at most four edges) are there between node number 4 and node number 8?

You must be logged in to see worked solutions.

Already have an account? Log in here.

How many distinct paths of length 4 (paths using 4 edges) that do not visit the same node more than once are there between node 0 and node 1?

You must be logged in to see worked solutions.

Already have an account? Log in here.

How many paths are there between node number 9 and node number 7?

You must be logged in to see worked solutions.

Already have an account? Log in here.

×

Problem Loading...

Note Loading...

Set Loading...