| Copyright | Copyright (C) 2021 Yoo Chung |
|---|---|
| License | GPL-3.0-or-later |
| Maintainer | dev@chungyc.org |
| Safe Haskell | Safe-Inferred |
| Language | GHC2021 |
Problems.P94
Description
Part of Ninety-Nine Haskell Problems. Some solutions are in Solutions.P94.
Synopsis
- regularGraphs :: Int -> Int -> [G]
Documentation
Generate \(k\)-regular graphs with \(n\) vertexes.
In a \(k\)-regular graph, all vertexes have a degree of \(k\). I.e., the number of edges incident in each vertex is \(k\). How many non-isomorphic 3-regular graphs with 6 vertexes are there? See Problems.P94.Examples for examples of \(k\)-regular graphs.
Examples
>>>length $ regularGraphs 6 32