Coates graph

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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.

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.

References

Text derived from https://en.wikipedia.org/w/index.php?oldid=1361823356 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001361823356 · captured 1782802329.0 · version history

Cite this page as: encyclopegia.org, “Coates graph”, snapshot enwiki-001361823356. https://encyclopegia.org/a/coates-graph

Sources cited in this revision

Extracted from the cited revision's reference blocks; absent citations are not invented.