English
Related papers

Related papers: Locally s-distance transitive graphs and pairwise …

200 papers

From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…

Combinatorics · Mathematics 2016-12-06 Sébastien Martineau

We give a unified approach to analysing, for each positive integer $s$, a class of finite connected graphs that contains all the distance transitive graphs as well as the locally $s$-arc transitive graphs of diameter at least $s$. A graph…

Combinatorics · Mathematics 2010-10-29 Alice Devillers , Michael Giudici , Cai Heng Li , Cheryl E. Praeger

The subdivision graph $S(\Sigma)$ of a connected graph $\Sigma$ is constructed by adding a vertex in the middle of each edge. In a previous paper written with Cheryl E. Praeger, we characterised the graphs $\Sigma$ such that $S(\Sigma)$ is…

Combinatorics · Mathematics 2011-03-31 Ashraf Daneshkhah , Alice Devillers

We study a class of edge-coloured graphs, including the chamber systems of buildings and other geometries such as affine planes, from which we build coherent configurations (also known as non-commutative association schemes). The condition…

Combinatorics · Mathematics 2022-02-03 Pierre Guillot

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…

Combinatorics · Mathematics 2018-10-23 Hui Zhou , Cheryl Praeger , Michael Giudici , Rongquan Feng , Xingui Fang

Recent work of Lazarovich provides necessary and sufficient conditions on a graph L for there to exist a unique simply-connected (k,L)-complex. The two conditions are symmetry properties of the graph, namely star-transitivity and…

Combinatorics · Mathematics 2013-01-10 Michael Giudici , Cai Heng Li , Akos Seress , Anne Thomas

This is a chapter in a forthcoming book on completely regular codes in distance regular graphs. The chapter provides an overview, and some original results, on codes in distance regular graphs which admit symmetries via a permutation group…

Combinatorics · Mathematics 2024-07-16 Daniel R. Hawtin , Cheryl E. Praeger

We construct the first infinite families of locally arc transitive graphs with the property that the automorphism group has two orbits on vertices and is quasiprimitive on exactly one orbit, of twisted wreath type. This work contributes to…

Combinatorics · Mathematics 2022-03-01 Eda Kaja , Luke Morgan

In this paper we construct distance-regular graphs admitting a transitive action of the five sporadic simple groups discovered by E. Mathieu, the Mathieu groups $M_{11}$, $M_{12}$, $M_{22}$, $M_{23}$ and $M_{24}$. From the code spanned by…

Combinatorics · Mathematics 2021-03-09 Dean Crnkovic , Nina Mostarac , Andrea Svob

The subdivision graph $S(\Sigma)$ of a graph $\Sigma$ is obtained from $\Sigma$ by `adding a vertex' in the middle of every edge of $\Si$. Various symmetry properties of $\S(\Sigma)$ are studied. We prove that, for a connected graph…

Group Theory · Mathematics 2011-01-19 Ashraf Daneshkhah , Alice Devillers , Cheryl E. Praeger

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…

Combinatorics · Mathematics 2011-10-12 Alice Devillers , Wei Jin , Cai Heng Li , Cheryl E. Praeger

A directed graph $G=(V,E)$ is {\it strongly pseudo transitive} if there is a partition $\{A,E-A\}$ of $E$ so that graphs $G_1=(V,A)$ and $G_2=(V,E-A)$ are transitive, and additionally, if $ab\in A$ and $bc\in E $ implies that $ac\in E$. A…

Combinatorics · Mathematics 2018-06-06 Farhad Shahrokhi

We construct distance-regular graphs, including strongly regular graphs, admitting a transitive action of the Chevalley groups $G_2(4)$ and $G_2(5)$, the orthogonal group $O(7,3)$ and the Tits group $T=$$^2F_4(2)'$. Most of the constructed…

Combinatorics · Mathematics 2018-10-08 Dean Crnkovic , Sanja Rukavina , Andrea Svob

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…

Combinatorics · Mathematics 2017-01-05 Yan-Li Qin , Jin-Xin Zhou

A $2$-distance-transitive graph is a vertex-transitive graph whose vertex stabilizer is transitive on both the first step and the second step neighborhoods. In this paper, we first answer a question of A. Devillers, M. Giudici, C. H. Li and…

Combinatorics · Mathematics 2025-08-05 Wei Jin , Jack H. Koolen , Chenhui Lv

We study lines through the origin of finite-dimensional complex vector spaces that enjoy a doubly transitive automorphism group. In doing so, we make fundamental connections with both discrete geometry and algebraic combinatorics. In…

Combinatorics · Mathematics 2021-03-08 Joseph W. Iverson , Dustin G. Mixon

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…

Combinatorics · Mathematics 2012-06-12 Italo J. Dejter

By varying a parameter of a one-dimensional piecewise smooth map, stable periodic orbits are observed. In this paper, complete analytic characterization of these stable periodic orbits is obtained. An interesting relationship between the…

Dynamical Systems · Mathematics 2011-02-10 Bhooshan Rajpathak , Harish K. Pillai , Santanu Bandopadhyay

In this paper, we study self-complementary distance-regular Cayley graphs over abelian groups. We prove that if a regular graph is self-complementary distance-regular, then it is self-complementary strongly regular. We also deal with…

Combinatorics · Mathematics 2023-01-18 Mojtaba Jazaeri

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,…

Combinatorics · Mathematics 2015-01-07 Alice Devillers , Cheryl E. Praeger
‹ Prev 1 2 3 10 Next ›