Related papers: Arc-transitive maps with coprime Euler characteris…
It is shown that exactly 7 distance-transitive cubic graphs among the existing 12 possess a particular ultrahomogeneous property with respect to oriented cycles realizing the girth that allows the construction of a related Cayley digraph…
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…
We compare three transitivity properties of finite graphs, namely, for a positive integer $s$, $s$-distance transitivity, $s$-geodesic transitivity and $s$-arc transitivity. It is known that if a finite graph is $s$-arc transitive but not…
Ordinary Differential Equations are derived for the adjoint Euler equations firstly using the method of characteristics in 2D. For this system of partial-differential equations, the characteristic curves appear to be the streamtraces and…
In this note we prove an effective characterization of when two finite-degree covers of a connected, orientable surface of negative Euler characteristic are isomorphic in terms of which curves have simple elevations, weakening the…
The action of the mapping class group of a surface on the collection of homotopy classes of disjointly embedded curves or arcs in the surface is discussed here as a tool for understanding Riemann's moduli space and its topological and…
We study a class of finite groups $G$ which behave similarly to elementary abelian $p$-groups with $p$ prime, that is, there exists a subgroup $N$ such that all elements of $G\setminus N$ are conjugate or inverse-conjugate under $\Aut(G)$.…
The isomorphism problem of Cayley graphs has been well studied in the literature, such as characterizations of CI (DCI)-graphs and CI (DCI)-groups. In this paper, we generalize these to vertex-transitive graphs and establish parallel…
We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each edge of the graph at least once. A special case is the…
We apply the Atiyah-Singer index theorem and tensor products of elliptic complexes to the cohomology of transitive Lie algebroids. We prove that the Euler characteristic of a representation of a transitive Lie algebroid $A$ over a compact…
Let $X$ be a finite vertex-transitive graph of valency $d$, and let $A$ be the full automorphism group of $X$. Then the arc-type of $X$ is defined in terms of the sizes of the orbits of the action of the stabiliser $A_v$ of a given vertex…
We compute Aut(W) for any even Coxeter group whose Coxeter diagram is connected, contains no edges labeled 2, and cannot be separated into more than 2 connected components by removing a single vertex. The description is given explicitly in…
In this paper we consider some classical varieties of linear algebras over the field which has characteristic 0. For every considered variety we take a category of the finite generated free algebras of this variety. And for every this…
The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…
Vertex-stabilizers of trivalent edge-transitive graphs have been classified by Tutte, Goldschmidt and some others in several previous papers. Tetravalent half-arc-transitive graphs form an important class of tetravalent edge-transitive…
We geometrically construct a homology theory that generalizes the Euler characteristic mod 2 to objects in the unoriented cobordism ring N_*(X) of a topological space X. This homology theory Eh_* has coefficients Z/2 in every nonnegative…
We consider the classification problem for several classes of countable structures which are "vertex-transitive", meaning that the automorphism group acts transitively on the elements. (This is sometimes called homogeneous.) We show that…
Gain graphs are graphs where the edges are given some orientation and labeled with the elements (called gains) from a group so that gains are inverted when we reverse the direction of the edges. Generalizing the notion of gain graphs, skew…
In this paper, we give an explicit description about the second Hochschild cohomology groups of bipartite Brauer graph algebras with trivial grading. Based on this, we provide geometric interpretations of deformations associated to some…
We give necessary and sufficient conditions for lobe-transitivity of locally finite and locally countable graphs whose connectivity equals 1. We show further that, given any biconnected graph $\Lambda$ and a "code" assigned to each orbit of…