Three Ways to Count Walks in a Digraph
classification
🧮 math.CO
keywords
digraphthreewalksalgebraapproachcombinatoricscountcounting
read the original abstract
We approach the problem of counting the number of walks in a digraph from three different perspectives: enumerative combinatorics, linear algebra, and symbolic dynamics.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.