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.
KeywordsSpan Tree Distinct Vertex Logical Numbering Closed Walk Directed Span Tree
Unable to display preview. Download preview PDF.