Orderly Algorithm to enumerate central groupoids and their graphs

Details Orderly Algorithm to enumerate central groupoids and their graphs Orderly Algorithm to enumerate central groupoids and their graphs

2004-07-05

arxiv.org/abs/math/0407070v1

Mathematics

Rings and Algebras

21 pages, 6 figures

Scientific paper

A graph has the unique path property UPP_n if there is a unique path of length n between any ordered pair of nodes. This paper reiterates Royle and MacKay's technique for constructing orderly algorithms. We wish to use this technique to enumerate all UPP_2 graphs of small orders 9 and 16. We attempt to use the direct graph formalism and find that the algorithm is inefficient. We introduce a generalised problem and derive algebraic and combinatoric structures with appropriate structure. We are able to then design an orderly algorithm to determine all UPP_2 graphs of order 9, which runs fast enough. We hope to be able to determine the UPP_2 graphs of order 16 in the near future.

Affiliated with

Also associated with

No associations

Rating

Orderly Algorithm to enumerate central groupoids and their graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Orderly Algorithm to enumerate central groupoids and their graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Orderly Algorithm to enumerate central groupoids and their graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-139727