Examples to a theorem of Weiss (Q1898865)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Examples to a theorem of Weiss |
scientific article |
Statements
Examples to a theorem of Weiss (English)
0 references
9 November 1995
0 references
This paper constructs infinite families of graphs with the following properties: The graphs have a vertex-transitive group of automorphisms whose vertex-stabilizer subgroup induces on the neighbors a primitive group containing an abelian regular normal subgroup; furthermore the subgroup fixing a vertex and all its neighbors pointwise has non-trivial intersection with the corresponding subgroup for an adjacent vertex. The referenced theorem of \textit{R. Weiss} [Math. Proc. Cambridge Philos. Soc. 85, 43-48 (1979; Zbl 0392.20002)] proves that, given these conditions, the graph has degree (valency) either \(3^n\) or \(4^n\) for some \(n\) (and several conclusions can be drawn about the group). The author constructs examples of degree \(3^n\) and \(4^n\) for every \(n\) (previous examples had degree 3 or 4). The construction is simply a type of \(n\)-fold Cartesian product, where \(n\)-tuples are adjacent when all corresponding positions are adjacent (distinct) vertices of the original graph (only one connected component of the result is used). The resulting graph has degree \(d^n\) if the original graph has degree \(d\) (and its automorphism group is essentially the wreath product of the original automorphism group with \(\text{Sym}_n\)). Four well-known graphs are listed (two of degree 3 and two of degree 4) whose \(n\)-fold products produce the infinite families with all the desired properties. Finally the author mentions further examples for a possible generalization of the theorem of Weiss.
0 references
vertex-transitive graph
0 references
vertex-transitive group of automorphisms
0 references
Cartesian product
0 references
theorem of Weiss
0 references