Related papers: Sporadic neighbour-transitive codes in Johnson gra…

A graph $\Gamma$ of even order is a bicirculant if it admits an automorphism with two orbits of equal length. Symmetry properties of bicirculants, for which at least one of the induced subgraphs on the two orbits of the corresponding…

We classify the pairwise transitive 2-designs, that is, 2-designs such that a group of automorphisms is transitive on the following five sets of ordered pairs: point-pairs, incident point-block pairs, non-incident point-block pairs,…

For a graph G, we define a small automorphism as one that maps some vertex into its neighbour. We investigate the edge colourings of G that break every small automorphism of G. We show that such a colouring can be chosen from any set of…

In this article, we study flag-transitive automorphism groups of non-trivial symmetric $(v, k, \lambda)$ designs, where $\lambda$ divides $k$ and $k\geq \lambda^2$. We show that such an automorphism group is either point-primitive of affine…

A digraph is $s$-arc-transitive if its automorphism group is transitive on directed paths with $s$ edges, that is, on $s$-arcs. Although infinite families of finite $s$-arc transitive digraphs of arbitrary valency were constructed by the…

For $k,s\geq2$, the $s$-stable Kneser graphs are the graphs with vertex set the $k$-subsets $S$ of $\{1,\ldots,n\}$ such that the circular distance between any two elements in $S$ is at least $s$ and two vertices are adjacent if and only if…

We classify the maximal $m$-distance sets in $\mathbb{R}^{n-1}$ which contain the representation of the Johnson graph $J(n, m)$ for $m = 2, 3$. Furthermore, we determine the necessary and sufficient condition for $n$ and $m$ such that the…

A loop is (right) automorphic if all its (right) inner mappings are automorphisms. Using the classification of primitive groups of small degrees, we show that there is no nonassociative simple commutative automorphic loop of order less than…

In the present paper, we discuss the class of Type III and Type IV codes from the perspectives of neighbors. Our investigation analogously extends the results originally presented by Dougherty [8] concerning the neighbor graph of binary…

This paper is devoted to the classification of all flag-transitive point-primitive non-trivial $2$-$(v, k, \lambda)$ designs with the alternating group $A_n$($n \le 10$) as the socle of their automorphism groups, and 87 different designs…

A new infinite family of bipartite cubic 3-arc transitive graphs is constructed and studied. They provide the first known examples admitting a 2-arc transitive vertex-biquasiprimitive group of automorphisms for which the index two subgroup…

There are many results on the minimum distance of a cyclic code of the form that if a certain set T is a subset of the defining set of the code, then the minimum distance of the code is greater than some integer t. This includes the BCH,…

We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…

In this paper, we reveal an intriguing relationship between two seemingly unrelated notions: letter graphs and geometric grid classes of permutations. An important property common for both of them is well-quasi-orderability, implying, in a…

In this paper, we study 2-geodesic-transitive graphs of order twice an odd prime power. Classifications of corresponding basic graphs and such graphs with almost simple automorphism groups are given, and a reduction theorem for general case…

We prove a conjecture by Van Dam and Sotirov on the smallest eigenvalue of (distance-$j$) Hamming graphs and a conjecture by Karloff on the smallest eigenvalue of (distance-$j$) Johnson graphs. More generally, we study the smallest…

In the mid-1990s, two groups of authors independently obtained classifications of vertex-transitive graphs whose order is a product of two distinct primes. In the intervening years it has become clear that there is additional information…

A $k$-regular graph is called a divisible design graph if its vertex set can be partitioned into $m$ classes of size $n$, such that two distinct vertices from the same class have exactly $\lambda_1$ common neighbours, and two vertices from…

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…

Distance-regular graphs have many beautiful combinatorial properties. Distance-transitive graphs have very strong symmetries, and they are distance-regular, i.e. distance-transitivity implies distance-regularity. In this paper, we give…