10.4 MTH 288
NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Find the number of paths of length n between two different vertices in K4 if n = 2.
2 paths
NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Find the number of paths of length n between two different vertices in K4 if n = 4.
20 paths
NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Find the number of paths of length n between two different vertices in K4 if n = 5.
61 paths
NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Find the number of paths of length n between two different vertices in K4 if n = 3.
7 paths
NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Determine whether each of these graphs is strongly connected; if not, check whether it is weakly connected.
neither strongly nor weakly connected
NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Consider the given graph: Answer the following questions for the given vertices of the graph. a, e, a, d, b, c, a Does the list of vertices form a path in the graph?
no no no NA
NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Consider the given graph: Answer the following questions for the given vertices of the graph.
no no no NA
Consider the given graphs: Click and drag the statements in correct order either to show that these graphs are not isomorphic or to find an isomorphism between them using paths.
there are two vertices in each graph that are not in any cycles of size 4 so try to construct an isomorphism that matches them, say u1 <-> v2 and u8 <-> v6 now u, is adjacent to u2 and u3, and v2 is adjacent to v1 and v3, so u2 <-> v3 and u3 <-> v3 proceeding along similar lines, complete the bijection with u5 <-> v8, u6 <-> v7, and u7 <-> v5 having thus been led to the only possible isomorphism, check that the 12 edges of G exactly correspond to the 12 edges of H, and the two graphs are isomorphic
NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Determine whether each of these graphs is strongly connected; if not, check whether it is weakly connected. The given graph is strongly connected.
true
The following graph is connected.
true
NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Determine whether each of these graphs is strongly connected; if not, check whether it is weakly connected.
weakly connected
NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Consider the given graph: Answer the following questions for the given vertices of the graph. a, e, b, c, b Does the list of vertices form a path in the graph? Is the path simple? What is the length of the path? (Enter NA if it is not a path.)
yes no no 4
NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Consider the given graph: Answer the following questions for the given vertices of the graph.
yes yes yes 5
The following graph is connected.
false
