We define the adjacency matrix of a graph. Simply put if an edge connects vertex i to vertex j, then place a one in both the (i,j) and (j,i) entry of the matrix. If there is no edge between the vertices, then place a zero. This matrix of zeroes and ones while seemingly simple plays an essential role in important applications like the Google page rank algorithm. We show that powers of this matrix count the number of paths of different lengths from one vertex to another.
#mikethemathematician, #mikedabkowski, #profdabkowski
Watch video The Adjacency Matrix of a Graph and its Powers online without registration, duration hours minute second in high quality. This video was added by user Mike, the Mathematician 03 August 2024, don't forget to share it with your friends and acquaintances, it has been viewed on our site 395 once and liked it 15 people.