Safe Haskell | None |
---|---|

Language | Haskell98 |

A module defining various strongly regular graphs, including the Clebsch, Hoffman-Singleton, Higman-Sims, and McLaughlin graphs.

A strongly regular graph with parameters (n,k,lambda,mu) is a (simple) graph with n vertices, in which the number of common neighbours of x and y is k, lambda or mu according as whether x and y are equal, adjacent, or non-adjacent. (In particular, it is a k-regular graph.)

Strongly regular graphs are highly symmetric, and have large automorphism groups.

# Documentation

paleyGraph :: (Ord t, Num t) => [t] -> Graph t Source

(+^) :: Ord a => [[a]] -> Permutation a -> [[a]] Source

(+^^) :: Ord a => [[a]] -> [Permutation a] -> [[[a]]] Source

inducedA7 :: Permutation Integer -> Permutation (Either [[Integer]] [Integer]) Source

hsA7 :: [Permutation Integer] Source

_HS :: [Permutation DesignVertex] Source