Skip to content

Author

Rostislav Klech

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Generating Functions and the Entropy Hierarchy of Strongly Connected Digraphs

We present a generating-function approach to the topological entropy of finite strongly connected digraphs, working throughout with digraphs in which loops are allowed but multiple edges are excluded. Using dominant singularities of path-generating functions, we recover by new analytic--combinatorial arguments the know...

Rostislav Klech · 1 citation
Preprint Sep 2026

Generating Functions and the Minimum Spectral Radius in Strongly Connected Digraphs with $m+2$ Edges

We study the minimum adjacency spectral radius in the class $\mathcal{SC}_{m+2}(m)$ of strongly connected digraphs with $m$ vertices and $m+2$ edges. Using generating functions for directed paths, we associate with the relevant digraphs topological polynomials whose smallest positive roots determine the corresponding s...

Rostislav Klech · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.