There is The Modelling and Computation and about graph question, the question is using in mathlab

7. 4 marks Write down the adjacency matrix A for the graph whose vertices are 1, 2, 3, 4, 5 and 6, and whose edges are the 12 pairs i,j) for which li -jl is not divisible by 3. Also find A2 and A3, and explain what the powers of A tell you about the connectedness and the diameter of the graph. 8. 4 marks] Let G be the weighted graph constructed by taking the complete graph K5, labelling its vertices 1 to 5, and then assigning weight 12i-jl +1 to every edge i,j) with l