Skip to main content
Log in

An asymptotic property of the number of spanning trees of double fixed step loop networks

  • Published:
Applied Mathematics-A Journal of Chinese Universities Aims and scope Submit manuscript

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

$$\frac{{T(C(p = {\text{l}},{\text{l}},q))}}{{T(C(p,{\text{l}},q))}} \to 2,p \to + \infty $$
(1)

.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Berman, A. and Plemmons. R. J., Nonnegative Matrices in the Mathematical Sciences, Academic Press, N.Y., 1979.

  2. Biggs, N., Algebraic Graph Theory, Cambri., 1976.

  3. Chen Kaizhou and Wang Kongming, A new continued fraction algorithm and its convergence, J. Com, Math., 10(1988), 35–44.

    MATH  Google Scholar 

  4. Erdos, P. and Hsu, D. F., Distributed loop networks with minimum transmission delay theoretical computer science, to appear.

  5. Grnarov, A., A highly reliable distributed loop network architecture, Proc. Int. Sytnp., Fault-Tolerant comput. Kyoto, Japan, 1990, 319–324.

    Google Scholar 

  6. Liu, M.T., Distributed loop computer networks, Adv. comput., 17(1978), 162–221.

    Google Scholar 

  7. Yong,X. R. and Zhang,F. J., A simple proof for the complexity of square circle, to appear.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Supported by National Natural Science Foundation of China.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11766-997-0024-9

Keywords

Navigation