Switchings, extensions, and reductions in central digraphs

DOI10.1016/j.jcta.2011.03.009zbMath1232.05086OpenAlexW2045522492WikidataQ56926601 ScholiaQ56926601MaRDI QIDQ549248

Gregor Leander, André Kündgen, Carsten Thomassen

Publication date: 7 July 2011

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.2011.03.009

zbMATH Keywords

central directed graphcentral groupoidunique path property

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Infinite graphs (05C63)

Related Items (5)

Rank relations between a \(\{0, 1\}\)-matrix and its complement ⋮ Possible numbers of \(x\)'s in an \(\{x, y\}\)-matrix with a given rank ⋮ Rectangular groupoids and related structures ⋮ Pitfalls and shortcomings for decompositions and alignment ⋮ Graphs with the unique path property: Structure, cycles, factors, and constructions

Uses Software

• PRESENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of two techniques for proving nonexistence of strongly regular graphs
• Orderly algorithm to enumerate central groupoids and their graphs
• On the impossibility of directed Moore graphs
• Central groupoids, central digraphs, and zero-one matrices \(A\) satisfying \(A^{2}=J\).
• On Moore Graphs with Diameters 2 and 3
• PRESENT: An Ultra-Lightweight Block Cipher
• The Friendship Theorem
• Notes on central groupoids
• Products of Points--Some Simple Algebras and their Identities

This page was built for publication: Switchings, extensions, and reductions in central digraphs