Algebraic determination of circuits in a directed graph

DOI10.1080/00207727908941669MaRDI QIDQ3041107zbMATH OpenOpenAlexFDO

Authors Pradip K. Srimani, Abhijit Sengupta

Publication date 1979

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

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

zbMATH Keywords

algorithm to enumerate all directed circuitsdirected graphreachability equations

Mathematics Subject Classification ID

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

Cites work

• Enumeration of the Elementary Circuits of a Directed Graph
• scientific article; zbMATH DE number 3446921 (Why is no real title available?)
• On Algorithms for Enumerating All Circuits of a Graph
• The number of paths and cycles in a digraph

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3041107)