Primož Potočnik

Elementary Abelian Covers of Graphs

AbstractLet

An infinite family of cubic edge- but not vertex-transitive graphs

{\mathcal{C}}

A list of 4-valent 2-arc-transitive graphs and finite faithful amalgams of index (4, 2)

G(X) be the set of all (equivalence classes of) regular covering projections of a given connected graph X along which a given group G ≤ Aut X of automorphisms lifts. There is a natural lattice structure on

Homogeneous factorisations of graphs and digraphs

{\mathcal{C}}

Empirical modeling of antibiotic fermentation process using neural networks and genetic algorithms

G(X), where ℘1 ≤ ℘2 whenever ℘2 factors through ℘1. The sublattice