• L. R. Foulds
Part of the Universitext book series (UTX)


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.


Span Tree Distinct Vertex Logical Numbering Closed Walk Directed Span Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1992

Authors and Affiliations

  • L. R. Foulds
    • 1
  1. 1.Department of Management SystemsUniversity of WaikatoHamiltonNew Zealand

Personalised recommendations