Constructing infinite one-regular graphs
From MaRDI portal
Publication:1970080
DOI10.1006/eujc.1999.0338zbMath0943.05044OpenAlexW2011335266MaRDI QIDQ1970080
Norbert Seifter, Dragan Marušič, Aleksander Malnič
Publication date: 5 September 2000
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1999.0338
Related Items (22)
Tetravalent one-regular graphs of order \(2pq\) ⋮ ON ARC-REGULAR FROBENIUS METACIRCULANTS ⋮ One-regular cubic graphs of order a small number times a prime or a prime square ⋮ Group actions, coverings and lifts of automorphisms ⋮ Automorphism groups of covering graphs ⋮ Cubic symmetric graphs of order a small number times a prime or a prime square ⋮ There exist no arc-regular prime-valent graphs of order four times an odd square-free integer ⋮ One-regular graphs of square-free order of prime valency ⋮ An infinite family of cubic one-regular graphs with unsolvable automorphism groups. ⋮ \(s\)-regular cyclic coverings of the three-dimensional hypercube \(Q_{3}\). ⋮ Arc-regular cubic graphs of order four times an odd integer ⋮ Finite 1-regular Cayley graphs of valency 5 ⋮ Infinitely many finite one-regular graphs of any even valency. ⋮ Construction of one-regular graphs of valency 4 and 6. ⋮ Cubic one-regular graphs of order twice a square-free integer ⋮ Pentavalent One-regular Graphs of Square-free Order ⋮ 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\) ⋮ Lifting graph automorphisms by voltage assignments ⋮ 1-REGULAR CAYLEY GRAPHS OF VALENCY 7 ⋮ Constructing an infinite family of cubic 1-regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Properties of graphs with polynomial growth
- The nonexistence of 8-transitive graphs
- A survey on graphs with polynomial growth
- Graphs with polynomial growth are covering graphs
- How to determine the maximum genus of a graph
- On 4-valent symmetric graphs
- A characterization of certain families of 4-valent symmetric graphs
- Automorphisms of graphs and coverings
- Remarks on path-transitivity in finite graphs
- p-solvable doubly transitive permutation groups
- The trivalent symmetric graphs of girth at most six
- Graphs and finite permutation groups
- Graphs and finite permutation groups. II
- AUTOMORPHISMS OF GRAPHS AND A CHARACTERIZATION OF LATTICES
- GRAPHS WITH POLYNOMIAL GROWTH
- A One-Regular Graph of Degree Three
- A family of one-regular graphs of valency 4
This page was built for publication: Constructing infinite one-regular graphs
