The number of spanning trees in a class of double fixed‐step loop networks
Xuerong Yong, Yuanping Zhang, Mordecai J. Golin · Networks · 2008
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 withnvertices and jumps of sizepandq, whenn=d1m, andq=d2m+pwhered1,d2, andpare arbitrary parameters andmis a variable. © 2008 Wiley Periodicals, Inc. NETWORKS, 2008