Author:
Grunwald Liliya A.,Kwon Young Soo,Mednykh Ilya
Publisher
Mathematical Institute, Tohoku University
Reference31 articles.
1. N. V. Abrosimov, G. A. Baigonakova, L. A. Grunwald and I. A. Mednykh, Counting rooted spanning forests in cobordism of two circulant graphs, Sib. Electron. Mat. Rep. 17 (2020), 814–823.
2. N. L. Biggs, Three remarkable graphs, Canad. J. Math. 25 (1973), 397–411.
3. F. T. Boesch and H. Prodinger, Spanning tree formulas and Chebyshev polynomials, Graphs Combin. 2 (1986), no. 1, 191–200.
4. D. Calan, A combinatorial derivation of the number of labeled forests, J. Integer Seq. 6 (2003), no. 4, Art. 03.4.7.
5. P. Chebotarev and E. Shamis, Matrix forest theorems, Preprint, (2006), arXiv:math/0602575.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献