View source for Flow graph (mathematics)

In [[graph theory]], a '''flow graph''' is a form of [[digraph]] associated with a set of [[linear algebraic]] or [[differential equations]].

== Description ==

Abrahams and Coverley write:

<blockquote>A signal flow graph is a network of nodes (or points) interconnected by directed branches, representing a set of linear algebraic equations. The nodes in a flow graph are used to represent the variables, or parameters, and the connecting branches represent the coefficients relating these variables to one another. The flow graph is associated with a number of simple rules which enable every possible solution [related to the equations] to be obtained.</blockquote>

Source: J. R. Abrahams, G. P. Coverley (2014). "Chapter 1: Elements of a flow graph". Signal flow analysis. Elsevier. p. 1. ISBN 9781483180700.

== See also ==

* [[Coates graph]]
* [[Digraph]]
* [[Graph (discrete mathematics]]
* [[Graph theory]]
* [[Mason graph]]
* [[Signal-flow graph]]

== External links ==

* [https://en.wikipedia.org/wiki/Flow_graph_(mathematics) Flow graph (mathematics)] @ Wikipedia

[[Category:Graph theory]]
[[Category:Mathematics]]