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

(+^) :: 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 #

data DesignVertex Source #

## Instances

Eq DesignVertex Source # | |

Defined in Math.Combinatorics.StronglyRegularGraph (==) :: DesignVertex -> DesignVertex -> Bool # (/=) :: DesignVertex -> DesignVertex -> Bool # | |

Ord DesignVertex Source # | |

Defined in Math.Combinatorics.StronglyRegularGraph compare :: DesignVertex -> DesignVertex -> Ordering # (<) :: DesignVertex -> DesignVertex -> Bool # (<=) :: DesignVertex -> DesignVertex -> Bool # (>) :: DesignVertex -> DesignVertex -> Bool # (>=) :: DesignVertex -> DesignVertex -> Bool # max :: DesignVertex -> DesignVertex -> DesignVertex # min :: DesignVertex -> DesignVertex -> DesignVertex # | |

Show DesignVertex Source # | |

Defined in Math.Combinatorics.StronglyRegularGraph showsPrec :: Int -> DesignVertex -> ShowS # show :: DesignVertex -> String # showList :: [DesignVertex] -> ShowS # |

_HS2 :: [Permutation DesignVertex] Source #

_HS :: [Permutation DesignVertex] Source #

_McL2 :: [Permutation DesignVertex] Source #

_McL :: [Permutation DesignVertex] Source #