# Locally triangular graphs and rectagraphs with symmetry

@article{Bamberg2015LocallyTG, title={Locally triangular graphs and rectagraphs with symmetry}, author={John Bamberg and Alice Devillers and Joanna B. Fawcett and C. Praeger}, journal={J. Comb. Theory, Ser. A}, year={2015}, volume={133}, pages={1-28} }

Abstract Locally triangular graphs are known to be halved graphs of bipartite rectagraphs, which are connected triangle-free graphs in which every 2-arc lies in a unique quadrangle. A graph Γ is locally rank 3 if there exists G ⩽ Aut ( Γ ) such that for each vertex u , the permutation group induced by the vertex stabiliser G u on the neighbourhood Γ ( u ) is transitive of rank 3. One natural place to seek locally rank 3 graphs is among the locally triangular graphs, where every induced… Expand

#### Tables and Topics from this paper

#### 5 Citations

#### References

SHOWING 1-10 OF 37 REFERENCES

Local 2-geodesic transitivity and clique graphs

- Computer Science, Mathematics
- J. Comb. Theory, Ser. A
- 2013

On the uniqueness of a certain thin near octagon (or partial 2-geometry, or parallelism) derived from the binary Golay code

- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 1983