A weighted graph G with countable vertex set is bounded if there is an upper bound on the maximum of the sum of absolute values of all edge weights incident to a vertex in G. In this paper, we prove a fundamental result on equitable partitions of bounded weighted graphs with twin subgraphs and use this fact to construct finite and bounded infinite graphs with pair and plus state transfer with the adjacency matrix as a Hamiltonian. We show that for each k≥3, (i) there are infinitely many connected unweighted graphs with maximum degree k admitting pair state transfer at τ∈{2π,2π}, and (ii) there are infinitely many signed graphs with exactly one negative edge weight and whose underlying unweighted graphs have maximum degree k admitting plus state transfer at τ∈{2π,2π}. Parallel results are proven for perfect state transfer between a plus state and a pair state, and for the existence of sedentary pair and plus states. We further prove that almost all connected unweighted finite planar graphs admit pair state transfer at τ∈{2π,2π}, and almost all connected unweighted finite planar graphs can be assigned a single negative edge weight resulting in plus state transfer, or perfect state transfer between a plus state and a pair state, at τ∈{2π,2π}. Analogous results are shown to hold for unweighted finite trees. Using blow-up graphs, Cayley graphs and graphs with tails, we construct new infinite families of (finite and infinite) unweighted graphs and signed graphs admitting pair or plus state transfer.