It is for a class that is a project based assignment that is for linear algebra using octave.
Linear Algebra based questions.
UTF-8 Cancer MolecularDotansQ Flashcards Amino Acads strue Projecti (1).pdf ode3/ Downloads/ Projecti %20(1 ).pdf he/chronos/u-s8e12dbd1686f1fide8893685b1 40sdoab3416des Exca mple: For the graph with 6 nodes shown bel ow, the e adjacency matrix A is 010 0 0 0 10 1 0 0 1 0 1 0 1 0 0 0.0 1 0.1 1 0 0 0 1 0 1 10 1 10 Theorem: Let A be the adjacency matrix of a graph and for any integer k number of paths of length k between nodes i and j. 1 let B A* Then by is the Exercise 1: To understand why the theorem is true, considel the case k - 2 and let B - A. In this case, the entries by of B are ber) aird iar for example loat a6iait ad 2 t23+a63@g3-164aataese + 066063 is le value of b6? What diese acli term in the sum tell us about he number of thof length two between rnd a? (Iorc ample. ec 2s lita l say that thereare path of engt one between nodes 6, 2and 2 W a hich gives oue path of lenugth iwo brtwen 6, 3.) t's lpplications, 5th. Ed d that the nome/ chronos/u-68e1 2dbd1 686f1 fde8893685b1 408d03b3416de3/ Downloads( Project 1%20(1).pdf Exercise 2: Use octave to compute A? and A for (1,2) element of A2 is zero; this says that there are no paths of length two between nodes 1, 2, Verify this by acency matrix A above. You should find that the inspecting the graph. Similarls, you should find that the (6,6) element of A is two; this says that there are two paths of length three between nodes 6, 6 (node 6 and itself). Using the graph verify that these paths are 6-4-5-6 and 6-5-4-6. In the same way, study t trices 42 and A to ansver the following questions: paths of length two are there between nodes 4,4? What are the paths? How many paths of length the grap three are there between nodes 4, 6? What are the paths? Definition: We will say that there is a contact of level n between nodes i,j on a graph if there is &3n between nodes i,j. Exercise 3: Given any integer n 1 let AA What is the significance of the elements ciy of C? In partieular, what does it mean ifa0, and what does it mean if cj >0? Is it possible to use C to identify which nodes i, j have a contact of level n with each other? accidents do happen. It is known that if a worker becomes contaminated with the substance, (s)he could spread it through contact with another worker. The graph below shows which workers have direct eontact with each other Exercise 4: Eight workers deuoted WiW's handle a dangerous substance. Safety precautions are taken, but W5 et ulF-8 Cancer Molecular eta sr x chronos/u68e12dbd1686f1fde8893685b 408d03 341 i Q Flash cardesAmino Acids-StructX Flasheards Amino Acids Struct x D Project1(1).pdf Project1 (1).pdf home/chronos/u-68e12dbd1686f fde8893685b1408d03b3416de3 6de3/Downloads/Project 1 %20(1).pdf W. W4 W2 W3 W1 Find the adjacency matrix A for the above graph Use octave to compute C+ A+A2 + A Which workers have a contact of level 3 with W3? Which workers ve to find the smallest value of n for which every worker has a contact of level n with every other Be specific, so that anyone could decide whether a worker . Using your own definition of dangerous, determine whieh workers are the most dangerous if coutaminated. are lots of plicit ions of adjacellevu natrices to fies outside mathematics. Do a little online have a contact of level 3 with W6? worker . Define what it means when a worker is dangerous. Be specific, so that anyone co your definition. is dangerous or not. according to Which are the least dangerouts? Explain your answers. escribe what the application is, including uti paragraph for each application. Im lig to you. For each dgesin the graph pretent. This should be a research and find two examples that what the vertices and e not asking for i inajor rport UTF-8 Cancer MolecularDotansQ Flashcards Amino Acads strue Projecti (1).pdf ode3/ Downloads/ Projecti %20(1 ).pdf he/chronos/u-s8e12dbd1686f1fide8893685b1 40sdoab3416des Exca mple: For the graph with 6 nodes shown bel ow, the e adjacency matrix A is 010 0 0 0 10 1 0 0 1 0 1 0 1 0 0 0.0 1 0.1 1 0 0 0 1 0 1 10 1 10 Theorem: Let A be the adjacency matrix of a graph and for any integer k number of paths of length k between nodes i and j. 1 let B A* Then by is the Exercise 1: To understand why the theorem is true, considel the case k - 2 and let B - A. In this case, the entries by of B are ber) aird iar for example loat a6iait ad 2 t23+a63@g3-164aataese + 066063 is le value of b6? What diese acli term in the sum tell us about he number of thof length two between rnd a? (Iorc ample. ec 2s lita l say that thereare path of engt one between nodes 6, 2and 2 W a hich gives oue path of lenugth iwo brtwen 6, 3.) t's lpplications, 5th. Ed d that the nome/ chronos/u-68e1 2dbd1 686f1 fde8893685b1 408d03b3416de3/ Downloads( Project 1%20(1).pdf Exercise 2: Use octave to compute A? and A for (1,2) element of A2 is zero; this says that there are no paths of length two between nodes 1, 2, Verify this by acency matrix A above. You should find that the inspecting the graph. Similarls, you should find that the (6,6) element of A is two; this says that there are two paths of length three between nodes 6, 6 (node 6 and itself). Using the graph verify that these paths are 6-4-5-6 and 6-5-4-6. In the same way, study t trices 42 and A to ansver the following questions: paths of length two are there between nodes 4,4? What are the paths? How many paths of length the grap three are there between nodes 4, 6? What are the paths? Definition: We will say that there is a contact of level n between nodes i,j on a graph if there is &3n between nodes i,j. Exercise 3: Given any integer n 1 let AA What is the significance of the elements ciy of C? In partieular, what does it mean ifa0, and what does it mean if cj >0? Is it possible to use C to identify which nodes i, j have a contact of level n with each other? accidents do happen. It is known that if a worker becomes contaminated with the substance, (s)he could spread it through contact with another worker. The graph below shows which workers have direct eontact with each other Exercise 4: Eight workers deuoted WiW's handle a dangerous substance. Safety precautions are taken, but W5 et ulF-8 Cancer Molecular eta sr x chronos/u68e12dbd1686f1fde8893685b 408d03 341 i Q Flash cardesAmino Acids-StructX Flasheards Amino Acids Struct x D Project1(1).pdf Project1 (1).pdf home/chronos/u-68e12dbd1686f fde8893685b1408d03b3416de3 6de3/Downloads/Project 1 %20(1).pdf W. W4 W2 W3 W1 Find the adjacency matrix A for the above graph Use octave to compute C+ A+A2 + A Which workers have a contact of level 3 with W3? Which workers ve to find the smallest value of n for which every worker has a contact of level n with every other Be specific, so that anyone could decide whether a worker . Using your own definition of dangerous, determine whieh workers are the most dangerous if coutaminated. are lots of plicit ions of adjacellevu natrices to fies outside mathematics. Do a little online have a contact of level 3 with W6? worker . Define what it means when a worker is dangerous. Be specific, so that anyone co your definition. is dangerous or not. according to Which are the least dangerouts? Explain your answers. escribe what the application is, including uti paragraph for each application. Im lig to you. For each dgesin the graph pretent. This should be a research and find two examples that what the vertices and e not asking for i inajor rport
