Hostname: page-component-848d4c4894-pftt2 Total loading time: 0 Render date: 2024-05-31T21:03:58.141Z Has data issue: false hasContentIssue false

From Matrices to Graphs

Published online by Cambridge University Press:  20 November 2018

W. T. Tutte*
Affiliation:
University of Waterloo, Waterloo, Ontario
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

All the matrices considered in this paper have their elements in the field of residues mod 2.

Two non-singular matrices are equivalent if each row of either matrix is a linear combination of rows of the other. The matrices then have equal numbers of rows and equal numbers of columns.

A nodal matrix is a non-singular matrix in which no column has more than two l's. A graphic matrix is a non-singular matrix equivalent to a nodal matrix.

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1964

References

1. Seshu, S. and Reed, M. B., Linear graphs and electrical networks (Reading, Mass., 1961).Google Scholar