Algebraic determination of circuits in a directed graph
- 1 December 1979
- journal article
- research article
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 10 (12) , 1409-1413
- https://doi.org/10.1080/00207727908941669
Abstract
An efficient method has been proposed in this paper to generate all directed circuits in a given arbitrary directed graph. A new concept, the reachability equation of a vertex, has been introduced to tackle the problem in a purely algebraic way.Keywords
This publication has 5 references indexed in Scilit:
- On Algorithms for Enumerating All Circuits of a GraphSIAM Journal on Computing, 1976
- Enumeration of the Elementary Circuits of a Directed GraphSIAM Journal on Computing, 1973
- A Systematic Method of Finding All Directed Circuits and Enumerating All DIrected PathsIEEE Transactions on Circuit Theory, 1967
- Generation of all Hamiltonian Circuits, Paths, and Centers of a Graph, and Related ProblemsIEEE Transactions on Circuit Theory, 1967
- The Number of Paths and Cycles in a DigraphPsychometrika, 1966