4 citations · 5 across the 7 of their papers we have counts for
7 papers
Strong connectivity and its applications
Peteris Daugulis
Directed graphs are widely used in modelling of nonsymmetric relations in various sciences and engineering disciplines. We discuss invariants of strongly connected directed graphs…
Graphs with vertices and cyclic automorphism group of order
Peteris Daugulis
The problem of finding upper bounds for minimal vertex number of graphs with a given automorphism group is addressed in this article for the case of cyclic -groups. We show that…
-vertex graphs with cyclic automorphism group of order
Peteris Daugulis
We describe computational results about undirected graphs having vertices and automorphism group isomorphic to , graphs which have less than $2|Aut…
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 .