Continued Fractions and Unique Factorization on Digraphs

We show that the characteristic series of walks (paths) between any two vertices of any finite digraph or weighted digraph G is given by a universal continued fraction of finite depth involving the simple paths and simple cycles of G. A simple path is a walk forbidden to visit any vertex more than o...

詳細記述

書誌詳細
主要な著者: Giscard, P, Thwaite, S, Jaksch, D
フォーマット: Journal article
出版事項: 2012