Abstract
In Section 1.2 we defined the concept of a digraph and discussed some of its elementary properties. In Sections 6.1 and 6.2 we introduced the first two of the matrices which can be used to specify and analyse a digraph, namely the adjacency and incidence matrices. Because of their great applicability, we now explore the properties of digraphs in their own right, emphasizing those properties which set them apart from their analogous graph theoretic counterparts. We explore digraph connectivity, traversability, matrices, directed trees, the principle of directional duality, and tournaments.
By indirections find directions out.
Hamlet, II,i — William Shakespeare
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer Science+Business Media New York
About this chapter
Cite this chapter
Foulds, L.R. (1992). Digraphs. In: Graph Theory Applications. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0933-1_7
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0933-1_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97599-3
Online ISBN: 978-1-4612-0933-1
eBook Packages: Springer Book Archive