Related papers: An explicit characterization of arc-transitive cir…
A graph is edge-primitive if its automorphism group acts primitively on the edge set. In this short paper, we prove that a finite 2-arc-transitive edge-primitive graph has almost simple automorphism group if it is neither a cycle nor a…
In this paper, we study the relationship between the radius $r$ and the attachment number $a$ of a tetravalent graph admitting a half-arc-transitive group of automorphisms. These two parameters were first introduced in~[{\em…
A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all transitive decompositions of the Johnson graphs such that the…
A graph Gamma is said to be 2-arc-transitive if its full automorphism group Aut(\Gamma) has a single orbit on ordered paths of length 2, and for G\leq Aut(\Gamma), \Gamma is G-regular if G is regular on the vertex set of \Gamma. Let G be a…
A vertex transitive graph $\Gamma$ is said to be $2$-distance transitive if for each vertex $u$, the group of automorphisms of $\Gamma$ fixing the vertex $u$ acts transitively on the set of vertices at distance $1$ and $2$ from $u$, while…
In this article, we present two new characterizations of circular-arc bigraphs based on their vertex ordering. Also, we provide a characterization of circular-arc bigraphs in terms of forbidden patterns with respect to a particular ordering…
In this paper we characterize permutation groups that are automorphism groups of coloured graphs and digraphs and are abelian as abstract groups. This is done in terms of basic permutation group properties. Using Schur's classical…
Circular-arc graphs are graphs that can be represented as intersection graphs of subpaths of a cycle. Interval graphs are graphs that can be represented as intersection graphs of subpaths of a path. Since cycles are locally paths, every…
A graph is said to be a bi-Cayley graph over a group H if it admits H as a group of automorphisms acting semiregularly on its vertices with two orbits. A non-abelian group is called an inner-abelian group if all of its proper subgroups are…
In this paper we determine automorphism groups of cyclic algebraic curves defined over finite fields of any characteristic.
This paper presents a characterization of edge-transitive graphs which are four regular and have girth four. This class consists of four infinite families plus four exceptional graphs.
In this note, we construct bipartite 2-walk-regular graphs with exactly 6 distinct eigenvalues as incidence graphs of group-divisible designs with the dual property. For many of them, we show that they are 2-arc-transitive dihedrants. We…
In this paper, we aim to address the open questions raised in various recent papers regarding characterization of circulant graphs with three or four distinct eigenvalues in their spectra. Our focus is on providing characterizations and…
A general framework of constructions of endoscopy correspondences via automorphic integral transforms for classical groups is formulated in terms of the Arthur classification of the discrete spectrum of square-integrable automorphic forms.…
Our main purpose is to introduce the notion of trans-datum for quivers, and apply it to the study of automorphism groups of path coalgebras and algebras. We observe that any homomorphism of path coalgebras is uniquely determined by a…
A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. In this paper we present a complete classification of all…
We classify all the $2$-arc-transitive strongly regular graphs, and use this classification to study the family of finite $(G,3)$-geodesic-transitive graphs of girth $4$ or $5$ for some group $G$ of automorphisms. For this application we…
These letters, written in 1998-2000, contain various basic results about Courant algebroids (CAs), such as classification of exact and transitive CAs, reduction of CAs, description in terms of symplectic dg manifolds, a canonical generating…
A Cayley (resp. bi-Cayley) graph on a dihedral group is called a {\em dihedrant} (resp. {\em bi-dihedrant}). In 2000, a classification of trivalent arc-transitive dihedrants was given by Maru\v si\v c and Pisanski, and several years later,…
A Cayley graph on a group $G$ has a natural edge-colouring. We say that such a graph is CCA if every automorphism of the graph that preserves this edge-colouring is an element of the normaliser of the regular representation of $G$. A group…