Finding path-lengths by the power of Adjacency matrix of an undirected graph

The powers of the adjacency matrix don't give you the number of paths but the number of walks between any two vertices. In other words, you need to consider walks such that some vertices/edges are repeated (which do exist).


You get the number of $k$ length walks. The difference between a path and a walk is that walks can repeat edges and vertices.

Tags:

Graph Theory

Adjacency Matrix

Matrices

Nonnegative Matrices

Related

What is the formal, precise definition of area (and that of volume) in geometry? Proof of a limit for a recursively-defined sequence Show that $1, (x-5)^2, (x-5)^3$ is a basis of the subspace $U$ of $\mathcal P_3(\Bbb R)$ How come $\lim_{n\rightarrow \infty} \frac{a_n}{a_{n-1}}$ be different than 1? Find $f$ such that $(f(x))^2 \ge f(x + y)(f(x) + y), \forall x, y$ Is there another topology on $\mathbb{R}$ that gives the same continuous functions from $\mathbb{R}$ to $\mathbb{R}$? Verify my understanding of a math joke. Does there exist a Hamel basis $\mathcal B$ for $\mathbb R$ over $\mathbb Q$ such that $a,b \in \mathcal B \implies \dfrac ab \in \mathcal B$? How to solve this determinant equation in a simpler way Example of a very simple math statement in old literature which is (verbatim) a pain to understand If $28a + 30b + 31c = 365$, then what is the value of $a +b +c$? Why don't logarithms work here?

Recent Posts