Constructing infinite one-regular graphs (Q1970080)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constructing infinite one-regular graphs |
scientific article; zbMATH DE number 1417661
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing infinite one-regular graphs |
scientific article; zbMATH DE number 1417661 |
Statements
Constructing infinite one-regular graphs (English)
0 references
5 September 2000
0 references
A graph \(X\) is said to be one-regular if the automorphism group of \(X\) acts regularly on the set of arcs of \(X\). The authors consider infinite one-regular graphs. Starting with an infinite family of finite one-regular graphs of valency 4, for each member of this family an infinite one-regular graph is constructed. These graphs are Cayley graphs of almost abelian groups and represent a subclass of graphs with polynomial growth.
0 references
automorphism group
0 references
one-regular graphs
0 references
Cayley graphs
0 references
