Posted by **Adjacency Matrix and Shortest Path** on Monday, September 10, 2012 at 10:50pm.

Construct a graph based on the adjacency matrix that appears below. Label all nodes with indices consistent with the placement of numbers within the matrix.

⌈0 6 0 5 0⌉

| 6 0 1 0 3 |

| 0 1 0 4 8 |

| 5 0 4 0 0 |

⌊0 3 8 0 0⌋

Describe the graph and why it is consistent with the matrix.

How many simple paths are there from vertex 1 to vertex 5? Explain.Which is the shortest of those paths?

## Answer this Question

## Related Questions

- Math - Hi! I need help with these two questions. Thanks! :) 1.) Can we multiply ...
- science - 1 A ……... is a rectangular array of numbers that are ...
- Math - A message was encoded using the matrix [7 2 3 1] and you can decode the ...
- Math - I have a few questions about T-Matrix. In excel, I am suppose to work ...
- Augmented Matrix - Perform row operations on the augmented matrix as far as ...
- MATHS----Matrix - For a given square matrix A the predicted values of matrix B ...
- matric - Let matrix p= [6 -4] 1 0 If where a and b are real numbers, I is a ...
- math - This is a matrix question. R is the matrix (3r 1) (s 2s) 1. State, in ...
- math - This is a matrix question. R is the matrix (3r 1) (s 2s) 1. State, in ...
- Algebra - Need help with these-- 40. The graph of the following system yields ...