Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/23935

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

Authors Yong, Xuerong
Zhang, Yuanping
Golin, Mordecai J. View this author's profile
Issue Date 2008
Source Networks , v. 52, (2), 2008, SEP, p. 69-77
Summary 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 C-n(p,q) the double fixed-step loop network with n vertices and jumps of size p and q, when n = d(1)m, and q = d(2)m + p where d(1), d(2), and p are arbitrary parameters and m is a variable. (C) 2008 Wiley Periodicals, Inc.
Subjects
ISSN 0028-3045
Language English
Format Article
Access View full-text via DOI
View full-text via Web of Science
View full-text via Scopus
Find@HKUST