Counting the number of spanning trees in a class of double fixed-step loop networks

A double fixed-step loop network, C→np,q, is a digraph on nn vertices 0,1,2,…,n−10,1,2,…,n−1 and for each vertex i(0