Lesson plan
Coates graph
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. The Coates graph G c (A) associated with an n × n matrix A is an n-node, weighted, labeled, directed graph. The nodes, labeled 1 through n, are each associated with the corresponding row/column of A. If entry a ji ≠ 0 then there is a directed edge from node i to node j with weight a ji . In other words, the Coates graph for matrix A is the one whose adjacency matrix is the transpose of A.
Article summary
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. The Coates graph G c (A) associated with an n × n matrix A is an n-node, weighted, labeled, directed graph. The nodes, labeled 1 through n, are each associated with the corresponding row/column of A. If entry a ji ≠ 0 then there is a directed edge from node i to node j with weight a ji . In other words, the Coates graph for matrix A is the one whose adjacency matrix is the transpose of A.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.