Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs-Reference-Cited by-同舟云学术

Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs

Published:2004 Issue: Volume: Page:508-521
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Golin Mordecai J.,Leung Yiu Cho,Wang Yajun

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-30551-4_45

Reference25 articles.

1. Baron, G., Prodinger, H., Tichy, R.F., Boesch, F.T., Wang, J.F.: The Number of Spanning Trees in the Square of a Cycle. Fibonacci Quarterly 23.3, 258–264 (1985)

2. Bedrosian, S.: The Fibonacci Numbers via Trigonometric Expressions. J. Franklin Inst. 295, 175–177 (1973)

3. Bermond, J.-C., Comellas, F., Hsu, D.F.: Distributed Loop Computer Networks: A Survey. Journal of Parallel and Distributed Computing 24, 2–10 (1995)

4. Second Edition;N. Biggs,1993

5. Boesch, F.T., Wang, J.F.: A Conjecture on the Number of Spanning Trees in the Square of a Cycle. In: Notes from New York Graph Theory Day, p. 16. New York Academy Sciences, New York (1982)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A FORMULA FOR THE NUMBER OF SPANNING TREES IN CIRCULANT GRAPHS WITH NONFIXED GENERATORS AND DISCRETE TORI;Bulletin of the Australian Mathematical Society;2015-08-25

2. Asymptotics for the Number of Spanning Trees in Circulant Graphs and Degenerating d-Dimensional Discrete Tori;Annals of Combinatorics;2015-05-20

3. An efficient approach for counting the number of spanning trees in circulant and related graphs;Discrete Mathematics;2010-04

4. The asymptotic number of spanning trees in circulant graphs;Discrete Mathematics;2010-02

5. The number of spanning trees in a class of double fixed-step loop networks;Networks;2008-09