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

@article{Fawcett2015LocallyTG, title={Locally triangular graphs and normal quotients of the n-cube}, author={Joanna B. Fawcett}, journal={Journal of Algebraic Combinatorics}, year={2015}, volume={44}, pages={119-130} }

For an integer $$n\ge 2$$n≥2, the triangular graph has vertex set the 2-subsets of $$\{1,\ldots ,n\}$${1,…,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…

## One Citation

## References

SHOWING 1-10 OF 20 REFERENCES

### On the Classification of Locally Hamming Distance-Regular Graphs

- Mathematics
- 1991

. A distance-regular graph is locally Hamming if it is locally isomorphic to a Hamming scheme $H(r, 2)$ . This paper rediscovers the connection among locally Hamming distance-regular graphs, designs,…

### 1-Homogeneous Graphs with Cocktail Party μ-Graphs

- Mathematics
- 2003

Let Γ be a graph with diameter d ≥ 2. Recall Γ is 1-homogeneous (in the sense of Nomura) whenever for every edge xy of Γ the distance partition{{z ∈ V(Γ) | ∂(z, y) = i, ∂(x, z) = j} | 0 ≤ i, j ≤ d}is…

### The Magma Algebra System I: The User Language

- Computer ScienceJ. Symb. Comput.
- 1997

The MAGMA language is presented, the design principles and theoretical background are outlined, and the constructors for structures, maps, and sets are outlined.

### On the graphs with μ - subgraphs isomorphic to K u × 2

- Proc . Steklov Inst . Math .
- 2001

### Q n ) where K is even, |K| = 2 and d K 2

### Let (x, σ) be the involution in K. Then i σ = i for some i ∈ [n] by Example 3 Thus the halved graphs of (Q n ) K are isomorphic by Proposition 4.2. 5. Locally T n graphs In this section

- Example 4.5. Let K Aut