Algebraic determination of circuits in a directed graph

DOI10.1080/00207727908941669zbMath0525.94029OpenAlexW2139043809MaRDI QIDQ3041107

Pradip K. Srimani, Abhijit Sengupta

Publication date: 1979

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207727908941669

zbMATH Keywords

directed graphalgorithm to enumerate all directed circuitsreachability equations

Mathematics Subject Classification ID

Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Determination of a circuit in a directed graph ⋮ Enumerating the cycles of a digraph: a new preprocessing strategy ⋮ An algorithm for finding a circuit of even length in a directed graph

Cites Work

• The number of paths and cycles in a digraph
• On Algorithms for Enumerating All Circuits of a Graph
• Enumeration of the Elementary Circuits of a Directed Graph
• Unnamed Item

This page was built for publication: Algebraic determination of circuits in a directed graph