The characterization of a graph via the variable adjacency matrix enables one to dene a partially ordered relation on the walks. Studying the incidence algebra on this poset reveals unsuspected relations between connected and self-avoiding walks on the graph. These relations are derived by considering truncated versions of the characteristic polynomial of variable adjacency matrix, resulting in a collection of matrices whose entries enumerate the self-avoiding walks of length from one vertex to another.