6 citations
3 papers
math.CO2016★ 6 cited
A note on a generalization of eigenvector centrality for bipartite graphs and applications
Peteris Daugulis
Eigenvector centrality is a linear algebra based graph invariant used in various rating systems such as webpage ratings for search engines. A generalization of the eigenvector cent…
q-bio.NC2014
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…
q-bio.NC2014
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…