Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-27T20:24:48.697Z Has data issue: false hasContentIssue false
  • English
  • Français

Graphs and determinants

Published online by Cambridge University Press:  22 September 2016

J. V. Greenman
J. V. Greenman*
Affiliation:
University of Essex, Wivenhoe Park, Colchester CO4 3SQ
Get access Rights & Permissions [Opens in a new window]

Extract

I would like to present a method for calculating determinants based on the notion of a graph (or network), a notion that is familiar to many pupils taking a modern mathematics course. The method involves four steps: (i) drawing the graph of the matrix; (ii) identifying certain subgraphs called Δ subgraphs; (iii) associating a number called a weight to each of these subgraphs; (iv) adding the weights to obtain the determinant. Let us take each of these steps in turn.

Type
Research Article
Information
The Mathematical Gazette , Volume 60 , Issue 414 , December 1976 , pp. 241 - 246
Copyright
Copyright © Mathematical Association 1976

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Mason, S. J., Feedback theory—some properties of signal flow graphs, Proc. Inst. Radio Engrs 41,1144–1156(1953).Google Scholar
2. Coates, C. L., Flow graph solutions of linear algebraic equations, Trans. Inst. Radio Engrs CT-6, 170–187 (1959).Google Scholar
3. Chen, W. K., Applied graph theory. North-Holland (1971).Google Scholar
4. Lorens, C. S., Flowgraphs. McGraw-Hill (1964).Google Scholar