1 x n:
A 1 x n, the matrix looks something like:
0 1 0 0 0 0 0...
1 0 1 0 0 0 0...
0 1 0 1 0 0 0...
0 0 1 0 1 0 0...
0 0 0 1 0 1 0...
Taking the determinant by the first column would result in the negative determinant of:
1 0 0 0 0 0...
1 0 1 0 0 0...
0 1 0 1 0...
0 0 1 0 ...
By using the first column again, we would subtract the determinant of:
0 1 0 0 0 ...
1 0 1 0 0 ...
0 1 0 1 0 ...
from the determinant of:
0 0 0 0 ...
1 0 1 0 ...
0 1 0 1 ...
0 0 1 0 ...
Let A_k be the adjacency matrix for a 1 x k grid.
A_1 = 0
det(A_1) = 0
A_2 =
0 1
1 0
det(A_2) = -1
A_3 =
0 1 0
1 0 1
0 1 0
det(A_3) = 0
A_4 =
0 1 0 0
1 0 1 0
0 1 0 1
0 0 1 0
det(A_4) = 1
We want to show that:
det(A_k) = 0 - det(A_(k-2)) = det(A_(k-2))
This works for A_3 and A_4:
det(A_3) = - det(A_1) = 0
det(A_4) = - det(A_2) = - (-1) = 1
So we assume that this holds for all A_i for i < or = k, and we want to show that this holds for A_(k+1).
A_(k+1) looks like this:
0 1 0 ...
1 0 1 ...
and so on.
If we take the determinant by the first column,
det(A_(k+1)) = -det(
1 0 0 0 0 0...
1 0 1 0 0 0...
0 1 0 1 0...
0 0 1 0 ...)
= det(
0 0 0 0 ...
1 0 1 0 ...
0 1 0 1 ...
0 0 1 0 ...)
-
0 1 0...
1 0 1 ...
= 0 - det(A_(k-1))










