Constructing infinite one-regular graphs
From MaRDI portal
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.
Recommendations
- Infinitely many finite one-regular graphs of any even valency.
- Construction of one-regular graphs of valency 4 and 6.
- A family of one-regular graphs of valency 4
- Constructing one-regular graphs of valency 4\(k\) with non-cyclic vertex stabilizer
- Infinitely many one-regular Cayley graphs on dihedral groups of any prescribed valency
Cites work
- A characterization of certain families of 4-valent symmetric graphs
- A family of one-regular graphs of valency 4
- A One-Regular Graph of Degree Three
- A survey on graphs with polynomial growth
- AUTOMORPHISMS OF GRAPHS AND A CHARACTERIZATION OF LATTICES
- Automorphisms of graphs and coverings
- Graphs and finite permutation groups
- Graphs and finite permutation groups. II
- GRAPHS WITH POLYNOMIAL GROWTH
- Graphs with polynomial growth are covering graphs
- How to determine the maximum genus of a graph
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 640673 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- scientific article; zbMATH DE number 3046496 (Why is no real title available?)
- On 4-valent symmetric graphs
- p-solvable doubly transitive permutation groups
- Properties of graphs with polynomial growth
- Remarks on path-transitivity in finite graphs
- The nonexistence of 8-transitive graphs
- The trivalent symmetric graphs of girth at most six
Cited in
(25)- Group actions, coverings and lifts of automorphisms
- Automorphism groups of covering graphs
- An infinite family of cubic one-regular graphs with unsolvable automorphism groups.
- \(s\)-regular cyclic coverings of the three-dimensional hypercube \(Q_{3}\).
- Infinitely many finite one-regular graphs of any even valency.
- Construction of one-regular graphs of valency 4 and 6.
- Lifting graph automorphisms by voltage assignments
- Constructing an infinite family of cubic 1-regular graphs
- Finite 1-regular Cayley graphs of valency 5
- Constructing one-regular graphs of valency 4\(k\) with non-cyclic vertex stabilizer
- Infinitely many one-regular Cayley graphs on dihedral groups of any prescribed valency
- One-regular normal Cayley graphs on dihedral groups of valency 4 or 6 with cyclic vertex stabilizer
- Classifying cubic symmetric graphs of order \(8p\) or \(8p^2\)
- 1-regular Cayley graphs of valency 7
- On arc-regular Frobenius metacirculants
- Pentavalent one-regular graphs of square-free order
- There exist no arc-regular prime-valent graphs of order four times an odd square-free integer
- Arc-regular cubic graphs of order four times an odd integer
- One-regular cubic graphs of order a small number times a prime or a prime square
- scientific article; zbMATH DE number 881157 (Why is no real title available?)
- One-regular graphs of square-free order of prime valency
- Tetravalent 1-regular normal Cayley graphs on dihedral groups
- Tetravalent one-regular graphs of order 2pq
- Cubic symmetric graphs of order a small number times a prime or a prime square
- Cubic one-regular graphs of order twice a square-free integer
This page was built for publication: Constructing infinite one-regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1970080)
