In mathematics, the Coates graph or Coates flow graph, named after C.L.
Coates, is a graph associated with the Coates' method for the solution of a system of linear equations.
[1][2] The Coates graph Gc(A) associated with an n × n matrix A is an n-node, weighted, labeled, directed graph.
If entry aji ≠ 0 then there is a directed edge from node i to node j with weight aji.
[3] In other words, the Coates graph for matrix A is the one whose adjacency matrix is the transpose of A.