The number of spanning trees in a class of double fixed‐step loop networks
The number of spanning trees in a class of double fixed‐step loop networks
Abstract In this article, we develop a method to count the number of spanning trees in certain classes of double fixed‐step loop networks with nonconstant steps. More specifically our technique finds the number of spanning trees in $ \overrightarrow{C} _{n}^{p,q} $ , the double fixed‐step loop network with n vertices …