Graphs with a locally linear group of automorphisms
Authors:
- 1 September 1995
- journal article
- Published by Cambridge University Press (CUP) in Mathematical Proceedings of the Cambridge Philosophical Society
- Vol. 118 (2) , 191-206
Abstract
Let Γ be an undirected graph, V(Γ) the vertex set of Γ and G a subgroup of aut(Γ). For each vertex x ↦ V(Γ), let Γx denote the set of vertices adjacent to x in Γ and the permutation group induced on Γx. by the stabilizer Gx. For each i ≥ 1, will denote the pointwise stabilizer in Gx of the set of vertices at distance at most i from x in Γ. Let for each i ≥ 1 and any set of vertices x, y, …, z of Γ. An s-path (or s-arc) is an (s + 1)-tuple (x0, x1, … xs) of vertices such that xi ↦ Γxi–1 for 1 ≤ i ≤ s and xi ╪ xi–2 for 2 ≤ i ≤ s.Keywords
This publication has 14 references indexed in Scilit:
- Graphs which are locally GrassmannMathematische Annalen, 1993
- GRAPHS WITH PROJECTIVE SUBORBITSMathematics of the USSR-Izvestiya, 1992
- On a Theorem of GoldschmidtAnnals of Mathematics, 1987
- The nonexistence of 8-transitive graphsCombinatorica, 1981
- Automorphisms of Trivalent GraphsAnnals of Mathematics, 1980
- Trees1980
- The nonexistence of certain Moufang polygonsInventiones Mathematicae, 1979
- Groups with a (B, N)–pair and locally transitive graphsNagoya Mathematical Journal, 1979
- Non-existence de certains, polygones généralisés, IInventiones Mathematicae, 1976
- ARC TRANSITIVITY IN GRAPHSThe Quarterly Journal of Mathematics, 1973