HaskellForMaths-0.4.5: Combinatorics, group theory, commutative algebra, non-commutative algebra

Safe HaskellSafe-Infered

Math.Combinatorics.StronglyRegularGraph

Description

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

isSRG :: Ord a => Graph a -> BoolSource

t' :: (Enum a, Enum t, Num a, Num t, Ord a, Ord t) => a -> Graph tSource

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

l2' :: (Enum a, Enum t, Num a, Num t, Ord a, Ord t) => a -> Graph tSource

l2 :: (Enum a, Num a, Ord a) => a -> Graph (a, a)Source

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

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

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

switch :: Ord t => Graph t -> [t] -> Graph tSource