Switchings, extensions, and reductions in central digraphs

DOI10.1016/J.JCTA.2011.03.009MaRDI QIDQ549248zbMATHOpenAlexDBLPWikidataFDO

Authors André Kündgen, Gregor Leander, 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)

Recommendations

• Switching reconstruction of digraphs
• Switching reconstruction of digraphs
• scientific article; zbMATH DE number 17815
• scientific article; zbMATH DE number 3912422
• scientific article; zbMATH DE number 7681426
• Switchings, realizations, and interpolation theorems for graph parameters
• A survey of sequences of central subgraphs
• Switching techniques for edge decompositions of graphs
• On switching classes of graphs

Cites work

• scientific article; zbMATH DE number 1735735 (Why is no real title available?)
• scientific article; zbMATH DE number 1542661 (Why is no real title available?)
• scientific article; zbMATH DE number 3232670 (Why is no real title available?)
• scientific article; zbMATH DE number 3358480 (Why is no real title available?)
• Central groupoids, central digraphs, and zero-one matrices \(A\) satisfying \(A^{2}=J\).
• Comparison of two techniques for proving nonexistence of strongly regular graphs
• Notes on central groupoids
• On Moore Graphs with Diameters 2 and 3
• On the impossibility of directed Moore graphs
• Orderly algorithm to enumerate central groupoids and their graphs
• PRESENT: An Ultra-Lightweight Block Cipher
• Products of Points--Some Simple Algebras and their Identities
• The Friendship Theorem

Cited in

(6)

• Rectangular groupoids and related structures
• Central groupoids, central digraphs, and zero-one matrices \(A\) satisfying \(A^{2}=J\).
• Possible numbers of \(x\)'s in an \(\{x, y\}\)-matrix with a given rank
• Graphs with the unique path property: Structure, cycles, factors, and constructions
• Pitfalls and shortcomings for decompositions and alignment
• Rank relations between a \(\{0, 1\}\)-matrix and its complement

Describes a project that uses

Uses Software

• PRESENT

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q549248)