Common consequents in directed graphs

DOI10.21136/CMJ.1985.102012zbMATH Open0575.05041OpenAlexW984696370MaRDI QIDQ3695285FDOQ3695285

Authors: Štefan Schwarz 

Publication date: 1985

Full work available at URL: https://eudml.org/doc/13507

Recommendations

• On cycles of directed graphs
• Maximally connected digraphs
• Contributions to Seymour's second neighborhood conjecture
• scientific article; zbMATH DE number 969185
• scientific article; zbMATH DE number 4047755

zbMATH Keywords

directed graphBoolean matricespath lengths

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• On a sharp estimation in the theory of binary relations on a finite set
• On the semigroup of binary relations on a finite set

Cited In (5)

• Title not available (Why is that?)
• $k$-common consequents in Boolean matrices
• An expansion property of Boolean linear maps
• New results on the common consequent index of a binary relation
• Stefan Schwarz (1914–1996)

This page was built for publication: Common consequents in directed graphs

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