Orderly algorithm to enumerate central groupoids and their graphs
From MaRDI portal
Publication:884884
DOI10.1007/s10114-005-0775-2zbMath1117.05054arXivmath/0407070OpenAlexW2141392192MaRDI QIDQ884884
Publication date: 7 June 2007
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0407070
Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items (8)
Simplicial complexes and closure systems induced by indistinguishability relations ⋮ Rectangular groupoids and related structures ⋮ Graphs with the unique path property: Structure, cycles, factors, and constructions ⋮ Pairings and related symmetry notions ⋮ Switchings, extensions, and reductions in central digraphs ⋮ Norm equalities and inequalities for three circulant operator matrices ⋮ Welch sets for random generation and representation of reversible one-dimensional cellular automata ⋮ Local dissymmetry on graphs and related algebraic structures
Uses Software
Cites Work
- On rational circulants satisfying \(A^ m=dI+\lambda J\)
- On the matrix equation \(A^k=J-I\)
- On the matrix equation \(A^m=\lambda J\)
- Digraph categories and line digraph functors
- On rational circulants satisfying \(A^2=dI+\lambda J\)
- On some solutions of \(A^k=dI+\lambda J\)
- \(g\)-circulant solutions to the (0,1) matrix equation \(A^m=J_n\)
- Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
- On the existence of finite central groupoids of all possible ranks. I
- Central groupoids, central digraphs, and zero-one matrices \(A\) satisfying \(A^{2}=J\).
- An orderly algorithm and some applications in finite geometry
- On the g-circulant solutions to the matrix equation \(A^m=\lambda J\)
- \(L\)-groupoids: Algebraic and topological properties of special groupoids
- Efficient exhaustive listings of reversible one dimensional cellular automata
- A generalization of the matrix equation \(A^ 2=J\)
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- Isomorph-Free Exhaustive Generation
- Notes on central groupoids
- Products of Points--Some Simple Algebras and their Identities
- Idempotent Semigroups
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Orderly algorithm to enumerate central groupoids and their graphs
