We proceed with digraph complexes, which are complexes in which each 0—cell is an ordered - as opposed to unordered - pair. We still denote a pair (i, j) as ij, but now ij and ji are different elements. We may divide the monotone digraph properties to be examined into two groups:
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Digraph Properties. In: Simplicial Complexes of Graphs. Lecture Notes in Mathematics, vol 1928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75859-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-75859-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75858-7
Online ISBN: 978-3-540-75859-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)