Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-13T12:43:58.719Z Has data issue: false hasContentIssue false

Enumeration of Paths in Digraphs

Published online by Cambridge University Press:  01 January 2025

K. R. Parthasarathy*
Affiliation:
Indian Institute of Technology, Kharagpur, India

Abstract

The solution of the problem of enumeration of the n-paths in a digraph has so far been attempted through an indirect approach of enumerating the redundant chains. The approach has yielded an algorithm for determination of the general formula for the matrix of redundant n-chains and also a partial recurrence formula for the same. This paper presents a direct approach to the problem. It gives a recurrence relation expressing the matrix of n-paths of a digraph in terms of the matrices of (n − 1)-paths of its first-order subgraphs. The result is exploited to give an algorithm for computing the matrix of n-paths. The algorithm is illustrated with a 6 × 6 matrix.

Information

Type
Original Paper
Copyright
Copyright © 1964 Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable