Question: Consider the graph G = (V,E) having the adjacency matrix A shown below. Assume the nodes are sequentially numbered starting with the number 1. Assume


Consider the graph G = (V,E) having the adjacency matrix A shown below. Assume the nodes are sequentially numbered starting with the number 1. Assume the node labels correlate sequentially to the rows of the adjacency matrix. 010100 101000 010110 101001 001001 000110 Use this information to answer the questions below. 1. Assume the graph is undirected. What is the value of |E| ? Blank 1 2. Assume the graph is directed. What is the value of |E| ? Blank 2 3. What is the value of |V| ? Blank 3 4. How many distinct walks/paths of length 16 are possible between nodes 6 and 37 Blank 4 5. How many distinct walks/paths of length 15 are possible between nodes 6 and 3?7 Blank 5 6. How many distinct walks/paths of length 12 are possible that start and end at node 37 (Hint: The solution is a 5 digit number) Blank 6 7. Is the graph simple? (Yes/No) Blank 7
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
