Central groupoids, central digraphs, and zero-one matrices \(A\) satisfying \(A^{2}=J\).

DOI10.1016/j.jcta.2003.10.001zbMath1046.15014OpenAlexW2090592834MaRDI QIDQ1427007

Daniel Pragel, Chi-Kwong Li, Frank E. Curtis, John H. Drew

Publication date: 14 March 2004

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2003.10.001

zbMATH Keywords

zero-one matricescentral digraphscentral groupoids

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Matrix equations and identities (15A24) Directed graphs (digraphs), tournaments (05C20) Matrices of integers (15B36) Sets with a single binary operation (groupoids) (20N02)

Related Items (4)

Orderly algorithm to enumerate central groupoids and their graphs ⋮ Rectangular groupoids and related structures ⋮ Graphs with the unique path property: Structure, cycles, factors, and constructions ⋮ Switchings, extensions, and reductions in central digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• \(g\)-circulant solutions to the (0,1) matrix equation \(A^m=J_n\)
• On the existence of finite central groupoids of all possible ranks. I
• Notes on central groupoids

This page was built for publication: Central groupoids, central digraphs, and zero-one matrices \(A\) satisfying \(A^{2}=J\).