Sciweavers

Share
NETWORKS
2008

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

8 years 4 months ago
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
Xuerong Yong, Yuanping Zhang, Mordecai J. Golin
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2008
Where NETWORKS
Authors Xuerong Yong, Yuanping Zhang, Mordecai J. Golin
Comments (0)
books