We enumerate the row-column-sums of all square tridiagonal $(0,1)$-matrices and prove that their count coincides with OEIS A022026 $-$ the number of acyclic subgraphs of the complete $2\times n$ grid graph. We then extend this correspondence in two independent directions: 1. admitting larger sets of matrix entries, and 2. relaxing the tridiagonal support to broader prescribed sparsity patterns. The latter leads us to conjecture that, for any bipartite graph $G$, the number of its acyclic subgraphs equals the number of degree sequences realized by subgraphs of $G$. Moreover, for any non-bipartite graph, the former should be strictly smaller than the latter. We discuss several general approaches and prove these hypotheses for cactus graphs and generalized book graphs.