Orderly algorithm to enumerate central groupoids and their graphs
From MaRDI portal
Abstract: 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.
Recommendations
Cites work
- \(g\)-circulant solutions to the (0,1) matrix equation \(A^m=J_n\)
- \(L\)-groupoids: Algebraic and topological properties of special groupoids
- A generalization of the matrix equation A^ 2=J
- An orderly algorithm and some applications in finite geometry
- Central groupoids, central digraphs, and zero-one matrices \(A\) satisfying \(A^{2}=J\).
- Digraph categories and line digraph functors
- Efficient exhaustive listings of reversible one dimensional cellular automata
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- scientific article; zbMATH DE number 4130413 (Why is no real title available?)
- scientific article; zbMATH DE number 475371 (Why is no real title available?)
- scientific article; zbMATH DE number 3333208 (Why is no real title available?)
- Idempotent Semigroups
- Isomorph-Free Exhaustive Generation
- Notes on central groupoids
- On rational circulants satisfying \(A^ m=dI+\lambda J\)
- On rational circulants satisfying \(A^2=dI+\lambda J\)
- On some solutions of A^k=dI+ J
- On the existence of finite central groupoids of all possible ranks. I
- On the g-circulant solutions to the matrix equation \(A^m=\lambda J\)
- On the matrix equation \(A^k=J-I\)
- On the matrix equation A^m= J
- Products of Points--Some Simple Algebras and their Identities
- Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
Cited in
(10)- Pairings and related symmetry notions
- Norm equalities and inequalities for three circulant operator matrices
- Welch sets for random generation and representation of reversible one-dimensional cellular automata
- Simplicial complexes and closure systems induced by indistinguishability relations
- Rectangular groupoids and related structures
- scientific article; zbMATH DE number 1735735 (Why is no real title available?)
- scientific article; zbMATH DE number 1885201 (Why is no real title available?)
- Local dissymmetry on graphs and related algebraic structures
- Switchings, extensions, and reductions in central digraphs
- Graphs with the unique path property: Structure, cycles, factors, and constructions
This page was built for publication: Orderly algorithm to enumerate central groupoids and their graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q884884)
