Three Ways to Count Walks in a Digraph

From MaRDI portal

MaRDI QIDQ6278288zbMATH OpenFDO

Authors Matthew Yancey

Publication date 4 October 2016




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 page was built for publication: Three Ways to Count Walks in a Digraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6278288)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Three_Ways_to_Count_Walks_in_a_Digraph&oldid=99032174"
Powered by MediaWiki