Abstract
It is proved that the determinant of the adjacency matrix for a finite subgraph G of Z × Z is 1, 0, or -1, provided that G has no "holes.".
Original language | English (US) |
---|---|
Pages (from-to) | 278-289 |
Number of pages | 12 |
Journal | Journal of Combinatorial Theory, Series B |
Volume | 35 |
Issue number | 3 |
DOIs | |
State | Published - Dec 1983 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics