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

In this paper, 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 Cp,q n , the double fixed-step loop network with n vertices and jumps of size p and q, when n = d1m, and q = d2m + p where d1, d2, p are arbitrary parameters and m is a variable. Key words: circulant digraph, spanning tree, Matrix Tree Theorem

• Type: Journal
• Year: 2008
• Where: NETWORKS
• Authors: Xuerong Yong, Yuanping Zhang, Mordecai J. Golin
• Keywords: Certain Classes, Computer Networks, Double Fixed-step Loop, Fixed-step Loop Network, NETWORKS 2008