scientific article; zbMATH DE number 3869360
From MaRDI portal
Publication:3337491
[For the entire collection see Zbl 0536.00004.] The problem of determining s-regular cubic graphs can be reduced to a series of coset enumerations. This problem and the way in which graphical constructions can be used to illuminate the results of the coset enumeration computations are discussed.
Recommendations
- Cubic \(s\)-regular graphs of order \(12p\), \(36p\), \(44p\), \(52p\), \(66p\), \(68p\) and \(76p\)
- A classification of cubic \(s\)-regular graphs of order 16\(p\)
- A classification of the cubic s-regular graphs of orders 12p and 12p^2
- s‐Regular cubic graphs as coverings of the complete bipartite graph K3,3
- Cubic symmetric graphs of order a small number times a prime or a prime square
Cited in
(3)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3337491)