Journal of Algebraic Combinatorics

, Volume 44, Issue 1, pp 119–130

# Locally triangular graphs and normal quotients of the n-cube

Article

## Abstract

For an integer $$n\ge 2$$, the triangular graph has vertex set the 2-subsets of $$\{1,\ldots ,n\}$$ and edge set the pairs of 2-subsets intersecting at one point. Such graphs are known to be halved graphs of bipartite rectagraphs, which are connected triangle-free graphs in which every 2-path lies in a unique quadrangle. We refine this result and provide a characterisation of connected locally triangular graphs as halved graphs of normal quotients of n-cubes. To do so, we study a parameter that generalises the concept of minimum distance for a binary linear code to arbitrary automorphism groups of the n-cube.

### Keywords

Locally triangular graph Rectagraph Normal quotient n-cube Semibiplane

## 1 Introduction

For an integer $$n\ge 2$$, the triangular graph$$T_n$$ has vertex set the 2-subsets of $$\{1,\ldots ,n\}$$ and edge set the pairs of 2-subsets intersecting at one point. A finite simple undirected graph $$\varGamma$$ is locally triangular (respectively, locally$$T_n$$) if for every vertex $$u\in V\varGamma$$, the graph induced by the neighbourhood $$\varGamma (u)$$ is isomorphic to a triangular graph (respectively, $$T_n$$).

Various classifications of locally triangular graphs with symmetry exist, including those that are strongly regular [6], 1-homogeneous [5, Theorem 4.4], and locally rank 3 [1]. These characterisations only admit a few families of graphs, but there are many more examples of locally triangular graphs; for instance, any connected component of the distance 2 graph of a coset graph of a binary linear code with minimum distance at least 7 is locally triangular (cf. Sect. 2 for definitions).

Locally triangular graphs are closely related to rectagraphs, which are connected triangle-free graphs with the property that every path of length 2 lies in a unique quadrangle. Specifically, a halved graph of a bipartite rectagraph with $$c_3=3$$ is locally triangular, and conversely, every connected locally triangular graph is a halved graph of a bipartite rectagraph with $$c_3=3$$ by [4, Proposition 4.3.9] (cf. Sect. 2 for definitions). Rectagraphs were first named by Perkel [9] and have been studied by various authors including [1, 3, 8]. Bipartite rectagraphs also have links to geometry, for such graphs are the incidence graphs of semibiplanes.

A large family of rectagraphs are quotients of the n-cube $$Q_n$$ by [4, Proposition 4.3.6]. For a graph $$\varGamma$$ and a partition $$\mathscr {B}$$ of $$V \varGamma$$, the quotient graph$$\varGamma _\mathscr {B}$$ is the simple graph with vertex set $$\mathscr {B}$$, where distinct $$B_1$$ and $$B_2$$ in $$\mathscr {B}$$ are adjacent whenever there exist $$x_1\in B_1$$ and $$x_2\in B_2$$ such that $$x_1$$ and $$x_2$$ are adjacent in $$\varGamma$$. If $$\mathscr {B}$$ is the set of orbits of $$K\le Aut( \varGamma )$$, then $$\varGamma _{\mathscr {B}}$$ is a normal quotient of $$\varGamma$$, and we write $$\varGamma _K$$ for $$\varGamma _{\mathscr {B}}$$. Normal quotients are particularly well behaved, for we retain some control of their automorphism groups, valencies and local actions.

Our first theorem improves the known characterisation of connected locally triangular graphs as halved graphs of bipartite rectagraphs. Note that every connected locally triangular graph is locally $$T_n$$ for some n by [4, Proposition 4.3.9], so it suffices to consider connected locally $$T_n$$ graphs. Precise definitions for terms in the following results, including the parameter $$d_K$$, are given in Sects. 2 and 3.

### Theorem 1.1

Let $$\varGamma$$ be a graph. Let $$n\ge 2$$. The following are equivalent.
1. (i)

$$\varGamma$$ is a connected locally $$T_n$$ graph.

2. (ii)

$$\varGamma$$ is a halved graph of $$(Q_n)_K$$ for some $$K\le Aut(Q_n)$$ such that K is even and $$d_K\ge 7$$.

Moreover, the group K in (ii) is unique up to conjugacy in $$Aut(Q_n)$$.

In fact, K acts semiregularly on $$VQ_n$$ and is therefore a 2-group. The even subgroups of $$Aut(Q_n)$$ are essentially those groups K for which $$(Q_n)_K$$ is bipartite (cf. Lemma 4.1), and the parameter $$d_K$$, first defined in [7], extends the concept of minimum distance for a binary linear code to arbitrary subgroups of $$Aut(Q_n)$$. Note that either $$d_K\le n$$ or $$d_K=\infty$$. Note also that a connected locally $$T_n$$ graph can be simultaneously a halved graph of a bipartite rectagraph and the distance 2 graph of a non-bipartite rectagraph (cf. Lemmas 4.1 and 5.1).

In order to prove Theorem 1.1, we first explore the relationship between the parameter $$d_K$$ and the normal quotient $$(Q_n)_K$$. It is well known that the n-cube $$Q_n$$ ($$n\ge 1$$) is a regular graph of valency n with $$a_{i-1}=0$$ and $$c_i=i$$ for all i. In our next result, we see that the parameter $$d_K$$ measures the extent to which $$(Q_n)_K$$ locally approximates the n-cube.

### Theorem 1.2

Let $$K\le Aut(Q_n)$$ and $$\ell$$ a positive integer. The following are equivalent.
1. (i)

$$(Q_n)_K$$ is regular of valency n with $$a_{i-1}=0$$ and $$c_i=i$$ for $$1\le i\le \ell$$.

2. (ii)

$$d_K\ge 2\ell +1$$.

Rectagraphs are precisely the connected graphs with $$a_1=0$$ and $$c_2=2$$, and they are always regular by [4, Proposition 1.1.2]. As a corollary of Theorem 1.2, [4, Proposition 4.3.6] and [1, Proposition 3.4], we obtain a characterisation of a large family of rectagraphs as normal quotients of n-cubes, from which Theorem 1.1 quickly follows. This result was proved with the extra assumption of distance-regularity in [7, Lemma 4].

### Corollary 1.3

Let $$\varPi$$ be a graph. The following are equivalent.
1. (i)

$$\varPi$$ is a rectagraph of valency n with $$a_2=0$$ and $$c_3=3$$.

2. (ii)

$$\varPi \simeq (Q_n)_K$$ for some $$K\le Aut(Q_n)$$ such that $$d_K\ge 7$$.

We also prove the following (cf. [1, Proposition 3.4] and [7, Lemma 5]).

### Theorem 1.4

Let $$K,L\le Aut(Q_n)$$ where $$d_K\ge 5$$. Then $$(Q_n)_K$$ and $$(Q_n)_L$$ are isomorphic if and only if K and L are conjugate in $$Aut(Q_n)$$. In particular, $$Aut((Q_n)_K)=N_{Aut(Q_n)}(K)/K$$.

As a consequence of Theorem 1.1, we can determine the automorphism group of a connected locally $$T_n$$ graph. In the following, $$E_n$$ denotes the set of vectors in $$\mathbb {F}_2^n$$ with even weight, and $$E_n:S_n$$ is an index 2 subgroup of $$Aut(Q_n)=\mathbb {F}_2\wr S_n$$.

### Theorem 1.5

Let $$\varGamma$$ be a halved graph of $$(Q_n)_K$$ where $$K\le Aut(Q_n)$$ is even with $$d_K\ge 7$$ and $$n\ge 5$$. Then $$Aut(\varGamma )=N_{E_n:S_n}(K)/K$$.

When C is a binary linear code in $$\mathbb {F}_2^n$$, the coset graph of C is the normal quotient $$(Q_n)_C$$, and if C has minimum distance at least 5, then $$(Q_n)_C$$ is a rectagraph. Moreover, as noted earlier, if C has minimum distance at least 7, then any connected component of the distance 2 graph of $$(Q_n)_C$$ is locally $$T_n$$. Every such rectagraph and locally $$T_n$$ graph is vertex-transitive. However, in general there are groups $$K\le Aut(Q_n)$$ for which neither $$(Q_n)_K$$ nor a corresponding locally $$T_n$$ graph is vertex-transitive (cf. Examples 3.12 and 5.2); in fact, in the examples we give, the parameter $$d_K$$ is nearly maximal.

Another property of a binary linear code C is that when $$(Q_n)_C$$ is bipartite and C has minimum distance at least 2, the halved graphs of $$(Q_n)_C$$ are isomorphic. Indeed, this is a consequence of the vertex-transitivity of $$(Q_n)_C$$. However, this is not true for arbitrary subgroups of $$Aut(Q_n)$$ (cf. Example 4.4). In light of Theorem 1.1, it would be interesting to classify those $$K\le Aut(Q_n)$$ with $$d_K\ge 2$$ for which the halved graphs of a bipartite $$(Q_n)_K$$ are isomorphic; we prove that this holds for every such K when n is odd (cf. Corollary 4.3).

This paper is organised as follows. In Sect. 2, we give some notation and basic definitions. In Sect. 3, we first define and analyse the parameter $$d_K$$, and then we prove Theorem 1.2, Corollary 1.3 and Theorem 1.4. In Sect. 4, we consider some properties of the distance 2 graph of $$(Q_n)_K$$, and in Sect. 5, we prove Theorems 1.1 and 1.5.

## 2 Notation and basic definitions

All groups in this paper are finite, all actions are written on the right, and all graphs are finite and undirected with no multiple edges or loops. Basic graph theoretical terminology may be found in [4].

For groups G and H, we denote a semidirect product of G with H (with normal subgroup G) by G : H, and if H acts faithfully on $$[n]:=\{1,\ldots ,n\}$$, then we denote the wreath product of G with H by $$G\wr H$$. If G acts on $$\varOmega$$ and $$\omega \in \varOmega$$, then $$G_{\omega }$$ denotes the pointwise stabiliser of $$\omega$$ in G and $$\omega ^G$$ the orbit of G containing $$\omega$$. We say that G is transitive if $$\omega ^G=\varOmega$$, and semiregular if $$G_\omega =1$$ for all $$\omega \in \varOmega$$. The symmetric group on n points is denoted by $$S_n$$.

Let $$\varGamma$$ be a graph. We write $$V\varGamma$$ for the vertex set of $$\varGamma$$, $$E\varGamma$$ for the edge set of $$\varGamma$$, and $$Aut(\varGamma )$$ for the automorphism group of $$\varGamma$$. If $$Aut(\varGamma )$$ is transitive on $$V\varGamma$$, then $$\varGamma$$ is vertex-transitive. The distance between $$u,v\in V\varGamma$$ is denoted by $$d_\varGamma (u,v)$$. For $$u\in V\varGamma$$ and $$i\ge 0$$, we define $$\varGamma _i(u):=\{v\in V\varGamma :d_\varGamma (u,v)=i\}$$ and $$\varGamma (u):=\varGamma _1(u)$$. For $$u,v\in V\varGamma$$ such that $$d_\varGamma (u,v)=i$$, let $$c_i(u,v) :=|\varGamma _{i-1}(u)\cap \varGamma (v)|$$ and $$a_i(u,v) :=|\varGamma _{i}(u)\cap \varGamma (v)|$$. We write $$c_i$$ (respectively, $$a_i$$) whenever $$c_i(u,v)$$ (respectively, $$a_i(u,v)$$) does not depend on the choice of u and v. The complete graph on n vertices is denoted by $$K_n$$, and the complete multipartite graph with n parts of size a is denoted by $$K_{n[a]}$$.

The distance 2 graph$$\varGamma _2$$ of a graph $$\varGamma$$ has vertex set $$V\varGamma$$, where two vertices are adjacent whenever their distance in $$\varGamma$$ is 2. If $$\varGamma$$ is connected but not bipartite, then $$\varGamma _2$$ is connected, and if $$\varGamma$$ is connected and bipartite, then $$\varGamma _2$$ has exactly two connected components; these are called the halved graphs of $$\varGamma$$. The bipartite double$$\varGamma .2$$ of a graph $$\varGamma$$ has vertex set $$V\varGamma \times \mathbb {F}_2$$, where vertices (ux) and (vy) are adjacent whenever u and v are adjacent in $$\varGamma$$ and $$x\ne y$$.

For graphs $$\varGamma$$ and $$\varPi$$, a surjective map $$\pi :\varGamma \rightarrow \varPi$$ is a covering if $$\pi$$ induces a bijection from $$\varGamma (x)$$ onto $$\varPi (x\pi )$$ for all $$x\in V\varGamma$$. We denote by $$K^\pi$$ the subgroup $$\{g\in Aut(\varGamma ): g\pi =\pi \}$$ of $$Aut(\varGamma )$$, where $$g\pi$$ denotes the composition of the functions g and $$\pi$$.

Let $$\mathbb {F}_2^n$$ be the vector space of n-tuples over the field $$\mathbb {F}_2$$. The weight$$|u|$$ of a vector $$u\in \mathbb {F}_2^n$$ is the number of non-zero coordinates in u, and the Hamming distance of $$u,v\in \mathbb {F}_2^n$$ is the number of coordinates at which u and v differ, or equivalently, $$|u+v|$$. For an m-subset $$\{i_1,\ldots ,i_m\}$$ of [n], let $$e_{i_1,\ldots ,i_m}$$ denote the vector of weight m in $$\mathbb {F}_2^n$$ whose $$i_j$$th coordinate is 1 for $$1\le j\le m$$. The subspace of $$\mathbb {F}_2^n$$ consisting of vectors with even weight is denoted by $$E_n$$.

For $$n\ge 1$$, the n-cube$$Q_n$$ is the graph with vertex set $$\mathbb {F}_2^n$$, where two vectors are adjacent whenever their Hamming distance is 1. The n-cube is a connected regular bipartite graph of valency n with parts $$E_n$$ and $$\mathbb {F}_2^n\setminus E_n$$. Its automorphism group is $$\mathbb {F}_2\wr S_n=\mathbb {F}_2^n: S_n$$, where $$\mathbb {F}_2^n$$ acts on $$VQ_n$$ by translation and $$S_n$$ acts by permuting coordinates. A subgroup K of $$Aut(Q_n)$$ is even if $$K\le E_n: S_n$$. We write elements of $$\mathbb {F}_2^n: S_n$$ in the form $$(x,\sigma )$$ where $$x\in \mathbb {F}_2^n$$ and $$\sigma \in S_n$$. A binary linear codeC is a subspace of $$\mathbb {F}_2^n$$, or, equivalently, an additive subgroup of $$\mathbb {F}_2^n$$. The minimum distance of C is the minimum weight of the non-zero elements of C when $$C\ne 0$$, and $$\infty$$ otherwise. The coset graph of C is the normal quotient $$(Q_n)_C$$.

## 3 The minimum distance of $$K\le Aut(Q_n)$$

Let $$K\le Aut(Q_n)$$. As in [7], we define the minimum distance of K, denoted by $$d_K$$, as follows:
\begin{aligned} d_K:=\left\{ \begin{array}{ll} \min \left\{ d_{Q_n}(x,x^k):x\in VQ_n,1\ne k\in K\right\} &{} \text{ if }\ K\ne 1, \\ \infty &{} \text{ otherwise }. \end{array} \right. \end{aligned}
This definition generalises the concept of minimum distance for a binary linear code, for if $$C\le \mathbb {F}_2^n$$, then $$d_{Q_n}(x,x^c)=d_{Q_n}(x,x+c)=|c|$$ for all $$x\in VQ_n$$ and $$c\in C$$.

Observe that $$d_K\ge 1$$ if and only if K is semiregular, which is true if and only if $$(Q_n)_K$$ has order $$2^n/|K|$$. Moreover, $$d_K=d_{g^{-1}Kg}$$ for all $$g\in Aut(Q_n)$$, and if $$K\ne 1$$, then $$d_K\le n$$.

We wish to find a canonical set of representatives for the vertices at distance $$\ell$$ from vertex $$x^K$$ in $$(Q_n)_K$$. This is not always possible, but we can say the following. Note that $$(Q_n)_\ell (x)=\{x+e\in VQ_n:|e|=\ell \}$$ for all $$x\in VQ_n$$ and $$\ell \in [n]$$.

### Lemma 3.1

Let $$K\le Aut(Q_n)$$ and $$\varPi :=(Q_n)_K$$. Then
\begin{aligned} \varPi _\ell (x^K)\subseteq \{(x+e)^K\in V\varPi :|e|=\ell \} \end{aligned}
for every positive integer $$\ell$$ and $$x \in VQ_n$$.

### Proof

Fix $$x\in VQ_n$$. If $$\varPi _1(x^K)$$ is empty, then $$\varPi _\ell (x^K)$$ is empty for all $$\ell \ge 1$$, and we are done. Otherwise, let $$y^K\in \varPi _1(x^K)$$. Then $$y^{k_1}$$ is adjacent to $$x^{k_2}$$ for some $$k_1,k_2\in K$$, so $$y^{k_1k_2^{-1}}$$ is adjacent to x. Thus $$y^{k_1k_2^{-1}}=x+e_i$$ for some i, and $$y^K=(x+e_i)^K$$. Suppose that $$\ell >1$$. Again, if $$\varPi _\ell (x^K)$$ is empty, then we are done, so we assume otherwise. Let $$y^K\in \varPi _\ell (x^K)$$. There exists a path $$(z_0^K,z_1^K,\ldots ,z_\ell ^K)$$ of length $$\ell$$ in $$\varPi$$ where $$z_0^K=x^K$$ and $$z_\ell ^K=y^K$$. Now $$z_{\ell -1}^K\in \varPi _{\ell -1}(x^K)$$, so we may assume by induction that $$z_{\ell -1}=x+e_{i_1,\ldots ,i_{\ell -1}}$$ for some $$i_1<\cdots <i_{\ell -1}\in [n]$$. Since $$y^K\in \varPi (z_{\ell -1}^K)$$, there exists $$i_\ell \in [n]$$ such that $$y^K=(z_{\ell -1}+e_{i_\ell })^K$$. If $$i_\ell \in \{i_1,\ldots ,i_{\ell -1}\}$$, then there is a path between $$y^K$$ and $$x^K$$ of length at most $$\ell -2$$, a contradiction. Thus $$y^K=(x+e_{i_1,\ldots ,i_{\ell -1}}+e_{i_\ell })^K$$ where $$|e_{i_1,\ldots ,i_{\ell -1}}+e_{i_\ell }|=\ell$$. $$\square$$

Next we have an elementary observation concerning $$d_K$$.

### Lemma 3.2

Let $$K\le Aut(Q_n)$$. If $$x^K= y^K$$ for distinct $$x,y\in VQ_n$$, then $$|x+y|\ge d_K$$.

### Proof

If $$x^K= y^K$$ for distinct $$x,y\in VQ_n$$, then there exists $$1\ne k\in K$$ such that $$x^k=y$$, so $$|x+y|=d_{Q_n}(x,x^k)\ge d_K$$.$$\square$$

The following is a straightforward consequence of Lemma 3.2 and the definition of $$d_K$$.

### Lemma 3.3

Let $$1\ne K\le Aut(Q_n)$$. If $$d_K\ge 3$$, then $$(Q_n)_K$$ has a cycle of length $$d_K$$.

By making some assumptions on $$d_K$$, we can improve Lemma 3.1.

### Lemma 3.4

Let $$K\le Aut(Q_n)$$ and $$\varPi :=(Q_n)_K$$. If $$d_K\ge 2\ell$$ for some positive integer $$\ell$$, then
\begin{aligned} \varPi _\ell (x^K)=\{(x+e)^K\in V\varPi :|e|=\ell \} \end{aligned}
for all $$x\in VQ_n$$.

### Proof

Fix $$x\in VQ_n$$. By Lemma 3.1, $$\varPi _\ell (x^K)\subseteq \{(x+e)^K\in V\varPi :|e|=\ell \}$$. In particular, we are done if $$\ell >n$$, so we assume that $$\ell \le n$$, and let $$y\in VQ_n$$ be such that $$|x+y|=\ell$$. Now $$d_\varPi (x^K,y^K)\le \ell$$. If $$d_\varPi (x^K,y^K)<\ell$$, then $$y^K=z^K$$ for some $$z\in VQ_n$$ where $$|x+z|<\ell$$ by Lemma 3.1, but $$y\ne z$$, so $$2\ell > |x+y+x+z|= | y+z|\ge d_K$$ by Lemma 3.2, a contradiction. Thus $$y^K\in \varPi _\ell (x^K)$$.$$\square$$

Although $$\genfrac(){0.0pt}1{n}{\ell }$$ is an upper bound on $$|\{(x+e)^K\in V\varPi :|e|=\ell \}|$$, these need not be equal in general, even for $$d_K\ge 2\ell$$. Indeed, suppose that $$d_K=2\ell$$ where $$\ell$$ is a positive integer. There exists $$y\in VQ_n$$ and $$1\ne k\in K$$ such that $$d_{Q_n}(y,y^k)=2\ell$$, so there exists $$x\in (Q_n)_\ell (y)\cap (Q_n)_\ell (y^k)$$, but this implies there exist distinct $$e,f\in VQ_n$$ such that $$|e|=\ell =|f|$$ and $$(x+e)^K=y^K=(x+f)^K$$.

Given $$K\le Aut(Q_n)$$, there is a natural map$$\pi :Q_n\rightarrow (Q_n)_K$$ defined by $$x\mapsto x^K$$ for all $$x\in VQ_n$$. The following result implies Theorem 1.2 with $$\ell =1$$.

### Lemma 3.5

Let $$K\le Aut(Q_n)$$ and $$\varPi :=(Q_n)_K$$. The following are equivalent.
1. (i)

The natural map $$\pi :Q_n\rightarrow \varPi$$ is a covering.

2. (ii)

$$\varPi$$ is regular of valency n.

3. (iii)

$$d_K\ge 3$$.

### Proof

Clearly (i) implies (ii), and (iii) implies (i) by Lemmas 3.2 and 3.4, so it remains to prove (ii) implies (iii). Suppose that $$d_K\le 2$$. If $$x^K=(x+e_i)^K$$ for some $$x\in VQ_n$$ and $$i\in [n]$$, then $$|\varPi (x^K)|<n$$, and if $$x^K=(x+e_{i,j})^K$$ for some $$x\in VQ_n$$ and distinct $$i,j\in [n]$$, then $$|\varPi ((x+e_i)^K)|<n$$. Thus we may assume that $$d_K=0$$, in which case there exist $$x\in VQ_n$$ and $$1\ne k\in K$$ such that $$x^k=x$$. Write $$k=(y,\sigma )$$. Clearly $$\sigma \ne 1$$, so $$\sigma$$ moves some $$i\in [n]$$. Let $$z:=x+e_i$$. Now
\begin{aligned} z^k=(x+e_i+y)^\sigma =x^k+e_{i^\sigma }=x+e_{i^\sigma }=z+e_{i,i^\sigma }, \end{aligned}
so $$|\varPi ((z+e_i)^K)|<n$$. $$\square$$

Next we consider the parameters $$a_i$$ and $$c_i$$.

### Lemma 3.6

Let $$K\le Aut(Q_n)$$ and $$\varPi :=(Q_n)_K$$. Let $$\ell$$ be a positive integer.
1. (i)

If $$d_K\ge 2\ell$$, then $$a_{\ell -1}=0$$.

2. (ii)

If $$d_K\ge 2\ell +1$$, then $$c_\ell =\ell$$.

### Proof

(i) Suppose that $$d_K\ge 2\ell$$, and let $$x^K,y^K,z^K\in V\varPi$$ be such that $$y^K\in \varPi _{\ell -1}(x^K)$$ and $$z^K\in \varPi _{\ell -1}(x^K)\cap \varPi (y^K)$$. By Lemma 3.1, we may assume that $$|x+y|=|x+z|=\ell -1$$ and $$z^K=(y+e_i)^K$$ for some $$i\in [n]$$. Note that $$z\ne y+e_i$$. Now $$2(\ell -1)+1\ge |z+y+e_i|\ge d_K$$ by Lemma 3.2, a contradiction. Thus $$a_{\ell -1}=0$$.

(ii) Suppose that $$d_K\ge 2\ell +1$$. Let $$x^K,y^K\in V\varPi$$ be such that $$y^K\in \varPi _{\ell }(x^K)$$. By Lemma 3.1, we may assume that $$y=x+e_{i_1,\ldots ,i_\ell }$$ for some $$i_1<i_2<\cdots <i_\ell \in [n]$$. By Lemmas 3.2 and 3.4, for $$1\le j\le \ell$$, the vertices $$(x+e_{i_1,\ldots ,i_\ell }+e_{i_j})^K$$ are pairwise distinct and lie in $$\varPi _{\ell -1}(x^K)\cap \varPi (y^K)$$. Thus $$|\varPi _{\ell -1}(x^K)\cap \varPi (y^K)|\ge \ell$$. Let $$z^K \in \varPi _{\ell -1}(x^K)\cap \varPi (y^K)$$. By Lemma 3.1, we may assume that $$|x+z|=\ell -1$$ and $$z^K=(x+e_{i_1,\ldots ,i_\ell }+e_i)^K$$ for some $$i\in [n]$$. If $$z\ne x+e_{i_1,\ldots ,i_\ell }+e_i$$, then $$2\ell \ge |z+x+e_{i_1,\ldots ,i_\ell }+e_i|\ge d_K$$ by Lemma 3.2, a contradiction. Thus $$z=x+e_{i_1,\ldots ,i_\ell }+e_i$$, so $$i\in \{i_1,\ldots ,i_\ell \}$$. Hence $$c_\ell =\ell$$.$$\square$$

The following result is a simple counting exercise; we prove it here for completeness.

### Lemma 3.7

Let $$\varPi$$ be a regular graph of valency n, and let $$\ell$$ be a positive integer. If $$a_{i-1}=0$$ and $$c_i=i$$ for $$1\le i\le \ell$$, then $$|\varPi _\ell (u)|=\genfrac(){0.0pt}1{n}{\ell }$$ for all $$u\in V\varPi$$.

### Proof

Let $$u\in V\varPi$$. Let $$m:=\min (\ell ,n)$$. Now $$\varPi _i(u)$$ is non-empty for $$0\le i\le m$$, for if not, then there exists $$0\le j<m$$ such that $$\varPi _{j}(u)\ne \varnothing$$ and $$\varPi _{j+1}(u)=\varnothing$$, but $$a_{j}=0$$ and $$c_{j}=j$$, so a vertex in $$\varPi _{j}(u)$$ has $$n-j$$ neighbours in $$\varPi _{j+1}(u)$$, a contradiction. In particular, if $$\ell >n$$, then $$\varPi _n(u)\ne \varnothing$$ and $$a_{n}=0$$ and $$c_{n}=n$$, so $$\varPi _{n+1}(u)=\varnothing$$ and $$|\varPi _\ell (u)|=0=\genfrac(){0.0pt}1{n}{\ell }$$.

Thus we may assume that $$\ell \le n$$. Now $$\varPi _{i}(u)$$ is non-empty for $$1\le i\le \ell$$. Since $$a_{\ell -1}=0$$ and $$c_{\ell -1}=\ell -1$$, every vertex in $$\varPi _{\ell -1}(u)$$ has $$n-\ell +1$$ neighbours in $$\varPi _\ell (u)$$. Thus the number of edges between $$\varPi _{\ell -1}(u)$$ and $$\varPi _\ell (u)$$ is $$(n-\ell +1)|\varPi _{\ell -1}(u)|$$. On the other hand, since $$c_\ell =\ell$$, the number of edges between $$\varPi _{\ell -1}(u)$$ and $$\varPi _\ell (u)$$ is $$\ell |\varPi _\ell (u)|$$. By induction, $$|\varPi _{\ell -1}(u)|=\genfrac(){0.0pt}1{n}{\ell -1}$$, so $$|\varPi _\ell (u)|=\genfrac(){0.0pt}1{n}{\ell }$$. $$\square$$

### Proof

(Theorem 1.2) Let $$\varPi :=(Q_n)_K$$. Suppose that $$\varPi$$ is regular of valency n with $$a_{i-1}=0$$ and $$c_i=i$$ for $$1\le i\le \ell$$. Then
\begin{aligned} |\varPi _i(x^K)|=\genfrac(){0.0pt}1{n}{i} \qquad \qquad (*) \end{aligned}
for all $$x\in VQ_n$$ and $$1\le i\le \ell$$ by Lemma 3.7, so
\begin{aligned} \varPi _i(x^K)=\{\left( x+e\right) ^K\in V\varPi :|e|=i\} \qquad \qquad (\dag ) \end{aligned}
for all $$x\in VQ_n$$ and $$1\le i\le \ell$$ by Lemma 3.1. Moreover, $$d_K\ge 3$$ by Lemma 3.5, so K is semiregular and $$\varPi$$ has $$2^n/|K|$$ vertices. If $$K=1$$, then $$d_K=\infty$$, as desired, so we may assume that $$K\ne 1$$. In particular, $$\ell <n$$, or else $$\varPi$$ has $$2^n$$ vertices by ($$*$$), in which case $$K=1$$.

Let $$x\in VQ_n$$ and $$1\ne k\in K$$. Note that $$x\ne x^k$$. Now $$d_{Q_n}(x,x^k)> \ell$$ by ($$\dag$$), so we may write $$d_{Q_n}(x,x^k)=j+\ell$$ for some positive integer j. Suppose for a contradiction that $$j\le \ell$$. There exists $$y\in VQ_n$$ such that $$d_{Q_n}(x,y)=j$$ and $$d_{Q_n}(y,x^k)=\ell$$, so $$y^K\in \varPi _j(x^K)\cap \varPi _\ell (x^K)$$ by ($$\dag$$). Thus $$j=\ell$$. Let $$x_1:=y+x$$ and $$x_2:=y+x^k$$. Now $$x_1$$ and $$x_2$$ are distinct vectors of weight $$\ell$$, while $$(y+x_1)^K=(y+x_2)^K$$, so $$| \{(y+e)^K\in V\varPi :|e|=\ell \}|<\genfrac(){0.0pt}1{n}{\ell }$$, contradicting ($$*$$) and ($$\dag$$). Hence $$d_K\ge 2\ell +1$$.

Conversely, suppose that $$d_K\ge 2\ell +1$$. Then $$\varPi$$ is regular of valency n by Lemma 3.5, and $$a_{i-1}=0$$ and $$c_i=i$$ for $$1\le i\le \ell$$ by Lemma 3.6. $$\square$$

The assumption that $$(Q_n)_K$$ has valency n cannot be removed from the statement of Theorem 1.2, as the following example shows.

### Example 3.8

For each positive $$m< n$$, there exists a subgroup K of $$Aut(Q_n)$$ with $$d_K=2$$ for which $$(Q_n)_K$$ is regular of valency m with $$a_{i-1}=0$$ and $$c_i=i$$ for all $$i\ge 1$$. Define K to be the set of vectors in $$E_n$$ whose first $$m-1$$ coordinates are 0. Let $$\pi :Q_n\rightarrow (Q_n)_K$$ be the natural map. Viewing $$Q_m$$ as the subgraph of $$Q_n$$ induced by $$\mathbb {F}_2^m\times 0^{n-m}$$, the restriction $$\pi :Q_m\rightarrow (Q_n)_K$$ is a graph isomorphism, and $$Q_m$$ has the desired properties.

### Proof

(Corollary 1.3) Let $$\varPi$$ be a rectagraph of valency n with $$a_2=0$$ and $$c_3=3$$. By [1, Lemma 3.1] (cf. [4, Lemma 4.3.5 and Proposition 4.3.6]), there exists a covering $$\pi :Q_n\rightarrow \varPi$$. Let $$K:=K^\pi =\{g\in Aut(Q_n):g\pi =\pi \}$$. Then $$\varPi \simeq (Q_n)_K$$ by [1, Proposition 3.4], and $$d_K\ge 7$$ by Theorem 1.2. The converse also follows from Theorem 1.2. $$\square$$

For $$K\le Aut(Q_n)$$, the normaliser $$N_{Aut(Q_n)}(K)$$ acts naturally on $$V(Q_n)_K$$ by
\begin{aligned} \big (x^K\big )^g:=\left( x^g\right) ^K \end{aligned}
for all $$x\in VQ_n$$ and $$g\in N_{Aut(Q_n)}(K)$$. For $$d_K\ge 5$$, in which case $$(Q_n)_K$$ is a rectagraph, every automorphism of $$(Q_n)_K$$ arises in this way by [1, Proposition 3.4] (cf. [7, Lemma 5]). We generalise this result (and its proof) in order to prove that isomorphisms of normal quotients arise only from conjugate groups, thereby establishing Theorem 1.4.

### Proposition 3.9

Let $$K,L\le Aut(Q_n)$$. Let $$\pi _K:Q_n\rightarrow (Q_n)_K$$ and $$\pi _L:Q_n\rightarrow (Q_n)_L$$ denote the natural maps.
1. (i)

If $$d_K\ge 5$$ and $$\varphi :(Q_n)_K\rightarrow (Q_n)_L$$ is a graph isomorphism, then there exists $$g\in Aut(Q_n)$$ such that $$g^{-1}Kg=L$$ and the diagram below commutes.

2. (ii)
If $$g\in Aut(Q_n)$$ and $$g^{-1}Kg=L$$, then there exists a graph isomorphism $$\varphi :(Q_n)_K\rightarrow (Q_n)_L$$ such that the diagram below commutes.

### Proof

(i) Suppose that $$\varphi :(Q_n)_K\rightarrow (Q_n)_L$$ is a graph isomorphism. By Theorem 1.2, $$(Q_n)_K$$ is a rectagraph of valency n, so $$(Q_n)_L$$ is a rectagraph of valency n, in which case Theorem 1.2 implies that $$d_L\ge 5$$. Hence $$\pi _K$$ and $$\pi _L$$ are coverings by Lemma 3.5. Let $$\theta :=\pi _L\varphi ^{-1}$$. Now $$\theta : Q_n\rightarrow (Q_n)_K$$ is a covering, so there exists $$y\in VQ_n$$ such that $$y\theta = 0^K$$, and $$\theta$$ induces a bijection from $$Q_n(y)$$ onto $$(Q_n)_K(0^K)=\{e_i^K:1\le i\le n\}$$ by Lemma 3.4. There exists a covering $$g:Q_n\rightarrow Q_n$$ for which $$0^g=y$$ and $$e_i^g=e_i^K\theta ^{-1}$$ for all $$i\le n$$ by [1, Lemma 3.1]. Now $$\pi _K$$ and $$g\theta$$ agree on $$\{0\}\cup Q_n(0)$$, so $$\pi _K=g\theta$$ by [1, Lemma 3.2]. Thus $$\pi _K \varphi =g\pi _L$$, and the diagram commutes. Since g is surjective, it must be injective, so $$g\in Aut(Q_n)$$. By [1, Lemma 2.4], $$K=K^{\pi _K}$$ and $$L=L^{\pi _L}$$. Hence for $$k\in K$$,
\begin{aligned} (g^{-1}kg)\pi _L=g^{-1}k\pi _K\varphi =g^{-1}\pi _K\varphi =g^{-1}g\pi _L=\pi _L, \end{aligned}
so $$g^{-1}Kg\le L$$; since $$2^n/|K|=2^n/|L|$$, we conclude that $$g^{-1}Kg=L$$, as desired.

(ii) Suppose that $$L=g^{-1}Kg$$ for some $$g\in Aut(Q_n)$$. Define $$\varphi : (Q_n)_K\rightarrow (Q_n)_L$$ by $$x^K\mapsto (x^g)^L$$ for all $$x\in VQ_n$$. Clearly the diagram commutes, and $$\varphi$$ is a graph isomorphism. $$\square$$

We remark that Proposition 3.9(i) cannot be improved to include $$d_K\le 4$$. Observe that if $$K, L\le Aut(Q_n)$$ such that $$(Q_n)_K\simeq (Q_n)_L$$ but K and L are not conjugate in $$Aut(Q_n)$$, then $$(d_K,d_L)\in \{0,1,2\}\times \{0,1,2\}$$ or $$\{(3,3),(4,4)\}$$ by Lemmas 3.3, 3.5 and 3.6(i). When $$n=6$$, examples of such K and L exist for each possible $$(d_K,d_L)$$ by [2].

Proposition 3.9 implies that rectagraphs arising from binary linear codes are fundamentally different to those arising from subgroups of $$Aut(Q_n)$$ not contained in $$\mathbb {F}_2^n$$, for if C is a binary linear code in $$\mathbb {F}_2^n$$, then $$g^{-1}Cg\le \mathbb {F}_2^n$$ for all $$g\in Aut(Q_n)$$.

### Proof

(Theorem 1.4) This follows from Proposition 3.9 and [1, Lemma 2.4]. $$\square$$

We finish this section with some examples. Recall that if $$d_K=\infty$$, then $$(Q_n)_K$$ is the n-cube, and if $$d_K$$ is finite, then $$d_K\le n$$. The groups with largest possible finite minimum distance are described in the following.

### Example 3.10

Let $$K\le Aut(Q_n)$$ where $$n\ge 4$$. If $$d_K=n-1$$ or n, then $$K=\{0,x\}$$ where $$x\in VQ_n$$ and $$|x|=n-1$$ or n, respectively. In the latter case, $$(Q_n)_K$$ is the folded n-cube. In both cases, K is a binary linear code, so $$(Q_n)_K$$ is vertex-transitive.

Next we consider the minimum distance of subgroups of $$Aut(Q_n)$$ of order 2.

### Example 3.11

Let $$K\le Aut(Q_n)$$ where $$|K|=2$$. Let $$(x,\sigma )$$ be the involution in K. Write $$x=(x_1,\ldots ,x_n)$$, and let $$fix(\sigma )$$ be the set of fixed points of $$\sigma$$. Then $$d_K=|\{i\in fix(\sigma ):x_i=1\} |$$.

In Example 3.10, we saw that the groups $$K\le Aut(Q_n)$$ with largest possible minimum distance are binary linear codes, and so the corresponding graphs are vertex-transitive. Now we see that there exist $$K\le Aut(Q_n)$$ such that $$d_K$$ is large but $$(Q_n)_K$$ is not vertex-transitive.

### Example 3.12

Suppose that $$n\ge 8$$. Choose $$x=(x_1,\ldots ,x_n)\in \mathbb {F}_2^n$$ with $$|x|=n-1$$ or n, and let $$\sigma :=(i\ j)$$ where $$x_i=1=x_j$$. Let $$K:=\{0,(x,\sigma )\}$$. Then $$K\le Aut(Q_n)$$ and $$d_K=n-3$$ or $$n-2$$, respectively. Let $$N:=N_{Aut(Q_n)}(K)=\{(y,\tau )\in Aut(Q_n):y^\sigma =y, x^\tau =x, \sigma \tau =\tau \sigma \}$$. Then $$e_{i}^K\notin (0^K)^N$$, so $$(Q_n)_K$$ is not vertex-transitive by Theorem 1.4.

## 4 Distance 2 graph of $$(Q_n)_K$$

It is well known that for a binary linear code C with $$d_C\ge 2$$, the graph $$(Q_n)_C$$ is bipartite precisely when $$C\le E_n$$. Moreover, when C is not even, the bipartite double $$(Q_n)_C.2$$ is isomorphic to $$(Q_n)_{C\cap E_n}$$, and for $$d_C\ge 4$$, every halved graph of $$(Q_n)_C.2$$ is isomorphic to the distance 2 graph of $$(Q_n)_C$$. These results generalise to subgroups K of $$Aut(Q_n)$$ with $$d_K\ge 2$$. Note that if K is such a group and $$L:=K\cap (E_n: S_n)$$, then L is an even subgroup of $$Aut(Q_n)$$ with $$d_L\ge 2$$.

### Lemma 4.1

Let $$K\le Aut(Q_n)$$ where $$d_K\ge 2$$, and let $$\varPi :=(Q_n)_K$$.
1. (i)

$$\varPi$$ is bipartite with parts $$\{x^K\in V\varPi :|x|\equiv i \mod 2\}$$ for $$i=0,1$$ if and only if K is even.

2. (ii)

If K is not even, then $$\varPi .2\simeq (Q_n)_{L}$$ where $$L:=K\cap (E_n: S_n)$$.

3. (iii)

If K is not even and $$d_K\ge 4$$, then every halved graph of $$\varPi .2$$ is isomorphic to $$\varPi _2$$.

### Proof

(i) Let $$B_i:=\{x^K\in V\varPi :|x|\equiv i \mod 2\}$$ for $$i=0,1$$. Suppose that K is even. If $$x\in VQ_n$$ and $$k\in K$$, then $$|x|\equiv |x^k|\mod 2$$, so $$B_0$$ and $$B_1$$ partition $$V\varPi$$. If $$x^K$$ and $$y^K$$ are adjacent and $$x^K\in B_0$$, then $$y^K\in B_1$$ by Lemma 3.1. Thus $$\varPi$$ is bipartite with parts $$B_0$$ and $$B_1$$.

Now suppose that K is not even. Let $$r:=\min \{d_{Q_n}(x,x^k): x\in VQ_n,\ k\in K\setminus (E_n: S_n)\}$$. Choose $$x\in VQ_n$$ and $$k\in K\setminus (E_n: S_n)$$ such that $$d_{Q_n}(x,x^k)=r$$. There exists a path $$(x_0,x_1,\ldots ,x_r)$$ in $$Q_n$$ such that $$x_0=x$$ and $$x_r=x^k$$. If $$x_i^K=x_j^K$$ for some $$0\le i<j<r$$, then $$x_i^\ell =x_j$$ for some $$\ell \in K$$, so $$d(x_i,x_i^\ell )=j-i<r$$. Thus $$\ell \in E_n: S_n$$. Since $$d_{Q_n}(x,x_i)=i$$ and $$d_{Q_n}(x_i,x^{k\ell ^{-1}})=d_{Q_n}(x_i^\ell , x^k)=r-j$$, it follows that $$d_{Q_n}(x,x^{k\ell ^{-1}})\le r+i-j<r$$. But $$k\ell ^{-1}\in K\setminus (E_n: S_n)$$, a contradiction. Since r is odd and $$r\ge d_K\ge 2$$, it follows that $$(x_0^K,\ldots ,x_{r}^K)$$ is an odd cycle, so $$\varPi$$ is not bipartite.

(ii) Define a map $$\varphi :(Q_n)_L\rightarrow \varPi .2$$ by $$x^L\mapsto (x^K,|x|\mod 2)$$ for all $$x\in VQ_n$$. Using Lemma 3.4, it is routine to verify that $$\varphi$$ is a graph isomorphism.

(iii) A halved graph $$\varGamma$$ of $$\varPi .2$$ has vertex set $$\{(x^K,i):x\in VQ_n\}$$ for some $$i\in \mathbb {F}_2$$, so there is a bijection $$\varphi :\varGamma \rightarrow \varPi _2$$ defined by $$(x^K,i)\mapsto x^K$$ for all $$x\in VQ_n$$. Since $$\varPi$$ has no triangles by Lemma 3.6, $$(x^K,i)$$ is adjacent to $$(y^K,i)$$ in $$\varGamma$$ if and only if $$d_\varPi (x^K,y^K)=2$$, so $$\varphi$$ is a graph isomorphism. $$\square$$

It is also well known that for a binary linear code C with $$d_C\ge 2$$, the halved graphs of $$(Q_n)_C$$ are isomorphic. However, as we will see shortly, this is not always true for arbitrary subgroups K of $$Aut(Q_n)$$ with $$d_K\ge 2$$. By Lemma 4.1(ii) and (iii), it is true when $$K=M\cap (E_n:S_n)$$ for some non-even subgroup M of $$Aut(Q_n)$$ with $$d_M\ge 4$$. Of course, such a group M normalises K, and we can generalise this observation as follows.

### Proposition 4.2

Let $$K\le Aut(Q_n)$$ be even where $$d_K\ge 2$$. If $$N_{Aut(Q_n)}(K)$$ is not even, then the halved graphs of $$(Q_n)_K$$ are isomorphic.

### Proof

Let $$\varGamma$$ and $$\varSigma$$ be the halved graphs of $$(Q_n)_K$$, and let $$g\in N_{Aut(Q_n)}(K)$$ be such that $$g\notin E_n:S_n$$. By Proposition 3.9(ii), the image of g in $$N_{Aut(Q_n)}(K)/K$$ is an automorphism of $$(Q_n)_K$$, and $$V\varGamma ^g=V\varSigma$$ by Lemma 4.1(i), so $$\varGamma$$ and $$\varSigma$$ are isomorphic.$$\square$$

Translating by the vector $$(1,\ldots ,1)$$ is central in $$Aut(Q_n)$$, so for odd n, the group $$N_{Aut(Q_n)}(K)$$ is not even, and we obtain the following immediate consequence of Proposition 4.2.

### Corollary 4.3

Let $$K\le Aut(Q_n)$$ be even where $$d_K\ge 2$$. If n is odd, then the halved graphs of $$(Q_n)_K$$ are isomorphic.

Next we give an example of a normal quotient whose halved graphs are not isomorphic.

### Example 4.4

Let $$x:=e_{1,2,3,4}$$ and $$y:=e_{1,3,6,8}$$. Let $$\sigma :=(15)(26)(37)(48)$$ and $$\tau :=(12)(34)(56)(78)$$. Let $$K:=\langle (x,\sigma ),(y,\tau )\rangle \le Aut(Q_8)$$. Note that K is isomorphic to the quaternion group. Now K is even and $$d_K=4$$, so $$\varPi :=(Q_n)_K$$ is bipartite. But $$|\varPi _2(0^K)|=13$$ while $$|\varPi _2(e_1^K)|=14$$, so the halved graphs of $$\varPi$$ are not isomorphic by Lemma 4.1(i).

If K is an even subgroup of $$Aut(Q_n)$$ such that $$d_K\ge 5$$, then the halved graphs of $$(Q_n)_K$$ are regular of valency $$\genfrac(){0.0pt}1{n}{2}$$ by Lemmas 3.6 and 3.7, in which case the failure we observed in Example 4.4 cannot occur. It would be interesting to determine in general when the halved graphs of a bipartite normal quotient are isomorphic, especially for those subgroups with minimum distance at least 5. We can at least say the following.

### Example 4.5

Let $$K\le Aut(Q_n)$$ where K is even, $$|K|=2$$ and $$d_K\ge 2$$. Let $$(x,\sigma )$$ be the involution in K. Then $$i^\sigma =i$$ for some $$i\in [n]$$ by Example 3.11, so $$e_i\in N_{Aut(Q_n)}(K)$$. Thus the halved graphs of $$(Q_n)_K$$ are isomorphic by Proposition 4.2.

## 5 Locally $$T_n$$ graphs

In this section, we prove Theorems 1.1 and 1.5. First we give a generalisation of one direction of Theorem 1.1.

### Lemma 5.1

Let $$K\le Aut(Q_n)$$ and $$\varPi :=(Q_n)_K$$ where $$n\ge 2$$. If $$d_K\ge 7$$, then any connected component of $$\varPi _2$$ is locally $$T_n$$.

### Proof

Let $$\varGamma$$ be a connected component of $$\varPi _2$$, and let $$x^K\in V\varGamma$$. By Lemma 3.4, there is a surjective map $$\varphi$$ from $$T_n$$ to the subgraph of $$\varGamma$$ induced by $$\varGamma (x^K)$$ defined by $$\{i,j\}\mapsto (x+e_{i,j})^K$$ for all $$\{i,j\}\in VT_n$$, and this map is injective by Lemma 3.2. Let $$\{i,j\}\in VT_n$$. By Lemma 3.4,
\begin{aligned} \varGamma ((x+e_{i,j})^K)=\{(x+e_{i,j}+e_{\ell ,m})^K\in V\varPi : \{\ell ,m\}\in VT_n\}. \end{aligned}
If $$(x+e_{i^{\prime },j^{\prime }})^K=(x+e_{i,j}+e_{\ell ,m})^K$$ for some $$\{i^{\prime },j^{\prime }\},\{\ell ,m\}\in VT_n$$ where $$|\{i,j\}\cap \{\ell ,m\}|=0$$, then $$6\ge |e_{i^{\prime },j^{\prime }}+e_{i,j}+e_{\ell ,m}|\ge d_K$$ by Lemma 3.2, a contradiction. Thus
\begin{aligned}&\varGamma (x^K)\cap \varGamma ((x+e_{i,j})^K)\\&\quad =\{(x+e_{\ell ,m})^K\in V\varPi :\{\ell ,m\}\in VT_n,\ |\{i,j\}\cap \{\ell ,m\}|=1 \}, \end{aligned}
and we conclude that $$\varphi$$ is a graph isomorphism. $$\square$$

### Proof

(Theorem 1.1) Suppose that $$\varGamma$$ is connected and locally $$T_n$$. Then $$\varGamma$$ is a halved graph of some bipartite rectagraph $$\varPi$$ of valency n with $$c_3=3$$ by [4, Proposition 4.3.9], so we may apply Corollary 1.3. Also, K is even by Lemma 4.1(i).

Conversely, suppose that $$\varGamma$$ is a halved graph of $$(Q_n)_K$$ for some $$K\le Aut(Q_n)$$ where K is even and $$d_K\ge 7$$. Then $$\varGamma$$ is locally $$T_n$$ by Lemma 5.1. The group K is unique up to conjugacy in $$Aut(Q_n)$$ by Theorem 1.4. $$\square$$

### Proof

(Theorem 1.5) Let $$\varPi :=(Q_n)_K$$ and $$N:=N_{Aut(Q_n)}(K)$$. Now $$Aut(\varPi )=N/K$$ by Theorem 1.4. Since $$\varGamma$$ is locally $$T_n$$ and $$n\ge 5$$, $$Aut(\varGamma )$$ is the setwise stabiliser of $$V\varGamma$$ in $$Aut(\varPi )$$ by [1, Lemma 4.2]. Recall that $$V\varGamma {=}\{x^K{\in } V\varPi :|x|{\equiv } i\mod 2\}$$ where $$i=0$$ or 1 by Lemma 4.1(i). Thus $$Aut(\varGamma )=N_{E_n:S_n}(K)/K$$. $$\square$$

Hence the automorphism group of a connected locally $$T_n$$ graph is essentially known for $$n\ge 5$$. This group can also be determined for $$n\le 4$$. Suppose that $$\varGamma$$ is a connected locally $$T_n$$ graph where $$n\le 4$$. Then $$\varGamma$$ is locally $$K_1$$ for $$n=2$$, $$K_3$$ for $$n=3$$, or $$K_{3[2]}$$ for $$n=4$$, so $$\varGamma$$ is $$K_2$$, $$K_4$$ or $$K_{4[2]}$$, respectively (i.e., $$\varGamma$$ is the halved n-cube). Hence $$Aut(\varGamma )$$ is $$S_2$$, $$S_4$$ or $$S_2\wr S_4$$, respectively. Note that $$Aut(\varGamma )$$ is only isomorphic to $$N_{E_n: S_n}(K)/K$$ when $$n=3$$.

We finish by observing that there are examples of locally $$T_n$$ graphs that are not vertex-transitive.

### Example 5.2

Let K and N be as in Example 3.12 where n is chosen so that $$(Q_n)_K$$ is bipartite and $$d_K\ge 7$$. Let $$\varGamma$$ be the halved graph of $$(Q_n)_K$$ with vertex set $$\{x^K\in V(Q_n)_K:|x|\ \text{ is } \text{ even }\}$$. If $$\ell \in [n]\setminus \{i,j\}$$, then $$e_{i,\ell }^K\notin (0^K)^N$$, so $$\varGamma$$ is not vertex-transitive by Theorem 1.5.

### References

1. 1.
Bamberg, J., Devillers, A., Fawcett, J.B., Praeger, C.E.: Locally triangular graphs and rectagraphs with symmetry. J. Comb. Theory Ser. A 133, 1–28 (2015)
2. 2.
Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symb. Comput. 24, 235–265 (1997)
3. 3.
Brouwer, A.E.: Classification of small $$(0,2)$$-graphs. J. Comb. Theory Ser. A 113, 1636–1645 (2006)
4. 4.
Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-Regular Graphs. Springer, Berlin (1989)
5. 5.
Jurišić, A., Koolen, J.: 1-homogeneous graphs with cocktail party $$\mu$$-graphs. J. Algebraic Comb. 18, 79–98 (2003)
6. 6.
Makhnev, A.A.: On the graphs with $$\mu$$-subgraphs isomorphic to $$K_{u\times 2}$$. Proc. Steklov Inst. Math. Suppl. 2, S169–S178 (2001). Translated from Trudy Instituta Matematiki UrO RAN, Vol.7, No. 2 (2001)Google Scholar
7. 7.
Matsumoto, M.: On the classification of locally Hamming distance-regular graphs. RIMS Kôkyûroku 768, 50–61 (1991). http://www.kurims.kyoto-u.ac.jp/kyodo/kokyuroku/contents/pdf/0768-07.pdf
8. 8.
Neumaier, A.: Rectagraphs, diagrams, and Suzuki’s sporadic simple group. Ann. Discrete Math. 15, 305–318 (1982)
9. 9.
Perkel, M.: On Finite Groups Acting on Polygonal Graphs. Ph.D. thesis, University of Michigan (1977)Google Scholar