A bi-Cayley graph Γ is a graph which admits a semiregular group H of automorphisms with
two orbits. In this paper, the normalizer of H in the full automorphism group of Γ is …

A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In this
paper, the s-regular elementary abelian coverings of the complete bipartite graph K3, 3 and …

Square tori are transformed into hexagonal and other tiling tori by several cutting
procedures. The toroidal objects thus generated are optimized by a molecular mechanics …

Abstract Grand Canonical Monte Carlo, GCMC, simulations are used to study the gravimetric
and volumetric hydrogen storage capacities of different carbon nanopores shapes: Slit …

A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In this
paper, we classify the s-regular elementary Abelian coverings of the three-dimensional …

A graph Γ admitting a group H of automorphisms acting semi-regularly on the vertices with
exactly two orbits is called a bi-Cayley graph over H. This generalisation of a Cayley graph …

A graph X is said to be distance-balanced if for any edge uv of X, the number of vertices
closer to u than to v is equal to the number of vertices closer to v than to u. A graph X is said …

Let p be a prime. It was shown by Folkman (J. Combin. Theory 3 (1967) 215) that a regular
edge-transitive graph of order 2p or 2p2 is necessarily vertex-transitive. In this paper an …

An automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-
arcs in the graph. A graph is s-regular if its full automorphism group is s-regular. For a …

Sažetak A 4-valent square tiled toroid is transformed into 3-valent hexagonal (and other
polygonal) lattices either by simple cutting procedures or by some more elaborated …