论文信息 - On the number of spanning trees in directed circulant graphs

On the number of spanning trees in directed circulant graphs

Let gk(n) [respectively, fk(n)] be the maximum number of spanning trees in directed circulant graphs (respectively, regular directed graphs) with n vertices and out-degrees equal to k > 1. We show that gk(n) = kn(1+o(1)) and fk(n) = kn(1+o(1)). Moreover, we prove that g2(n) = ⌊(2n + 1)/3⌋. © 2001 John Wiley & Sons, Inc.

Zbigniew Lonc | Krzysztof Parol | Jacek M. Wojciechowski

[1] Jarosław Arabas,et al. Designing regular graphs with the use of evolutionary algorithms , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[2] Michael R. Fellows,et al. Counting spanning trees in directed regular multigraphs , 1989 .

[3] Brendan D. McKay,et al. Spanning Trees in Regular Graphs , 1983, Eur. J. Comb..

[4] Zbigniew Lonc,et al. On the asymptotic behavior of the maximum number of spanning trees in circulant graphs , 1997 .

[5] F. T. Boesch,et al. A Conjecture on the Number of Spanning Trees in the Square of a Cycle , 1982 .

[6] Helmut Prodinger,et al. Spanning tree formulas and chebyshev polynomials , 1986, Graphs Comb..

[7] F. Boesch,et al. Super line-connectivity properties of circulant graphs , 1986 .