4 citations · 5 across the 7 of their papers we have counts for
4 papers · 1 filter
Connectome graphs and maximum flow problems
Peteris Daugulis
We propose to study maximum flow problems for connectome graphs. We suggest a few computational problems: finding vertex pairs with maximal flow, finding new edges which would incr…
Homomorphisms of connectome graphs
Peteris Daugulis
We propose to study homomorphisms of connectome graphs. Homomorphisms can be studied as sequences of elementary homomorphisms - folds, which identify pairs of vertices. Several fol…
-vertex graphs with cyclic automorphism group of order
Peteris Daugulis
We describe computational results about undirected graphs having vertices and automorphism group isomorphic to .
Graph structure of commuting functions
Peteris Daugulis
The problem of finding graph structure of functions commuting with a given function in terms of their functional graphs is considered. Structure of functional graphs of commuting f…