Switchings, extensions, and reductions in central digraphs
DOI10.1016/J.JCTA.2011.03.009zbMATH Open1232.05086DBLPjournals/jct/KundgenLT11OpenAlexW2045522492WikidataQ56926601 ScholiaQ56926601MaRDI QIDQ549248FDOQ549248
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
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Infinite graphs (05C63)
Cites Work
- PRESENT: An Ultra-Lightweight Block Cipher
- On the impossibility of directed Moore graphs
- On Moore Graphs with Diameters 2 and 3
- Title not available (Why is that?)
- Central groupoids, central digraphs, and zero-one matrices \(A\) satisfying \(A^{2}=J\).
- Notes on central groupoids
- Products of Points--Some Simple Algebras and their Identities
- Orderly algorithm to enumerate central groupoids and their graphs
- Title not available (Why is that?)
- The Friendship Theorem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Comparison of two techniques for proving nonexistence of strongly regular graphs
Cited In (6)
- Rectangular groupoids and related structures
- Graphs with the unique path property: Structure, cycles, factors, and constructions
- Central groupoids, central digraphs, and zero-one matrices \(A\) satisfying \(A^{2}=J\).
- Rank relations between a \(\{0, 1\}\)-matrix and its complement
- Pitfalls and shortcomings for decompositions and alignment
- Possible numbers of \(x\)'s in an \(\{x, y\}\)-matrix with a given rank
Uses Software
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)
