Abstract
Let T(C(p,l,q)) be the number of spanning trees of circulant graph C(Ρ,1, g). In this note we show that
.
Similar content being viewed by others
References
Berman, A. and Plemmons. R. J., Nonnegative Matrices in the Mathematical Sciences, Academic Press, N.Y., 1979.
Biggs, N., Algebraic Graph Theory, Cambri., 1976.
Chen Kaizhou and Wang Kongming, A new continued fraction algorithm and its convergence, J. Com, Math., 10(1988), 35–44.
Erdos, P. and Hsu, D. F., Distributed loop networks with minimum transmission delay theoretical computer science, to appear.
Grnarov, A., A highly reliable distributed loop network architecture, Proc. Int. Sytnp., Fault-Tolerant comput. Kyoto, Japan, 1990, 319–324.
Liu, M.T., Distributed loop computer networks, Adv. comput., 17(1978), 162–221.
Yong,X. R. and Zhang,F. J., A simple proof for the complexity of square circle, to appear.
Author information
Authors and Affiliations
Additional information
Supported by National Natural Science Foundation of China.
Rights and permissions
About this article
Cite this article
Xuerong, Y., Fuji, Z. An asymptotic property of the number of spanning trees of double fixed step loop networks. Appl. Math. Chin. Univ. 12, 233–236 (1997). https://doi.org/10.1007/s11766-997-0024-9
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11766-997-0024-9