Infinitely many finite one-regular graphs of any even valency.
From MaRDI portal
Publication:1425118
DOI10.1016/S0095-8956(03)00084-4zbMath1033.05054MaRDI QIDQ1425118
Publication date: 15 March 2004
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Related Items (9)
Constructing one-regular graphs of valency 4\(k\) with non-cyclic vertex stabilizer ⋮ Cubic symmetric graphs of order a small number times a prime or a prime square ⋮ One-regular graphs of square-free order of prime valency ⋮ Construction of one-regular graphs of valency 4 and 6. ⋮ A classification of regular \(t\)-balanced Cayley maps on dicyclic groups ⋮ Classification of 2-arc-transitive dihedrants ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- On weakly symmetric graphs of order twice a prime
- Maps and half-transitive graphs of valency 4
- Arc-transitive Cayley graphs of valency at most four on abelian groups
- Constructing infinite one-regular graphs
- Characterisation of Graphs which Underlie Regular Maps on Closed Surfaces
- A One-Regular Graph of Degree Three
- A family of one-regular graphs of valency 4
This page was built for publication: Infinitely many finite one-regular graphs of any even valency.