Related papers: Semi-equivelar and vertex-transitive maps on the t…
If the face\mbox{-}cycles at all the vertices in a map are of same type then the map is called semi\mbox{-}equivelar. A tiling is edge-homogeneous if any two edges with vertices of congruent face-cycles. In general, edge-homogeneous maps on…
A 2-uniform tiling is an edge-to-edge tiling by regular polygons having $2$ distinct transitivity classes of vertices. There are 20 distinct 2-uniform tilings (these are of $14$ different types) on the plane, and since the plane is the…
A connected graph whose automorphism group acts transitively on the edges and vertices, but not on the set of ordered pairs of adjacent vertices of the graph is called half-arc-transitive. It is well known that the valence of a…
One version of the polycirculant conjecture states that every vertex-transitive graph has a semiregular automorphism. We give a proof of the conjecture in the arc-transitive case for graphs of valency 8, which was the smallest open case.
A graph is called {\em half-arc-transitive} if its full automorphism group acts transitively on vertices and edges, but not on arcs. It is well known that for any prime $p$ there is no tetravalent half-arc-transitive graph of order $p$ or…
If the cyclic sequences of {face types} {at} all vertices in a map are the same, then the map is said to be a semi-equivelar map. In particular, a semi-equivelar map is equivelar if the faces are the same type. Homological quantum codes…
A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not its arc set. In this paper, we study all tetravalent half-arc-transitive graphs of order $12p$.
If a map has k transitivity classes of vertices that are subject to the action of the automorphism group, it is said to be k-uniform. The classification of 1-uniform maps on the torus is known. In this article, we classify 2-uniform maps on…
A connected graph of order $n$ admitting a semiregular automorphism of order $n/k$ is called a $k$-multicirculant. Highly symmetric multicirculants of small valency have been extensively studied, and several classification results exist for…
The automorphism group of a map acts naturally on its flags (triples of incident vertices, edges, and faces). An Archimedean map on the torus is called almost regular if it has as few flag orbits as possible for its type; for example, a map…
A tiling (edge-to-edge) of the plane is a family of tiles that cover the plane without gaps or overlaps. Vertex figure of a vertex in a tiling to be the union of all edges incident to that vertex. A tiling is $k$-vertex-homogeneous if any…
Let $G$ be a compact Lie group. We prove that if $V$ and $W$ are orthogonal $G$-representations such that $V^G=W^G=\{0\}$, then a $G$-equivariant map $S(V) \to S(W)$ exists provided that $\dim V^H \leq \dim W^H$ for any closed subgroup…
The polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism, that is, a nontrivial automorphism whose cycles all have the same length. In this paper we investigate the existence of semiregular…
A graph is edge-transitive if the natural action of its automorphism group on its edge set is transitive. An automorphism of a graph is semiregular if all of the orbits of the subgroup generated by this automorphism have the same length.…
A corner in a map is an edge-vertex-edge triple consisting of two distinct edges incident to the same vertex. A corneration is a set of corners that covers every arc of the map exactly once. Cornerations in a dart-transitive map generalize…
Following Alspach and Parsons, a {\em metacirculant graph} is a graph admitting a transitive group generated by two automorphisms $\rho$ and $\sigma$, where $\rho$ is $(m,n)$-semiregular for some integers $m \geq 1$, $n \geq 2$, and where…
In this work, we present several new findings regarding the concepts of orbit-transitivity, strict orbit-transitivity, $\omega$-transitivity, and $\mu$-open-set transitivity for self-maps on generalized topological spaces. Let $(X,\mu)$…
A graph is vertex-transitive if its automorphism group acts transitively on vertices of the graph. A vertex-transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this paper,…
We prove that every finite arc-transitive graph of valency twice a prime admits a nontrivial semiregular automorphism, that is, a non-identity automorphism whose cycles all have the same length. This is a special case of the Polycirculant…
A face-transitive surface is a triangulated 2-dimensional manifold whose automorphism group acts transitively on its set of triangles. In this paper, we investigate this class of highly symmetric surface triangulations. We identify seven…