Skip to main content

Consortium for Mathematics and its Applications

Product ID: 99591
Supplementary Print
Undergraduate

Determining the Reachability of a Digraph (UMAP)

Author: Rina Yarmish


This module provides an investigation of digraphs, including the determination of the existence of paths from point A to point B. Once reachability is determined, the question of how many paths exist of particular lengths is discussed and answered. Definitions are introduced and matrix representation described.

Table of Contents:

1. INTRODUCTION

2. DEFINITIONS AND EXAMPLES

3. PROPERTIES OF THE MATRIX OF A DIGRAPH

4. THE REACHABILITY MATRIX

5. REERENCES

6. BIBLIOGRAPHY

7. ANSWERS TO EXERCISES

©1983 by COMAP, Inc.
UMAP Module
19 pages

Mathematics Topics:

Discrete & Finite Mathematics , Abstract & Linear Algebra

Application Areas:

Prerequisites:

Matrix addition and multiplication.

You must have a Full Membership to download this resource.

If you're already a member, login here.

Not yet a member?