Author:
Kamalov U. P.,Kutbaev A. B.,Mednykh A. D.
Reference10 articles.
1. F. T. Boesch and H. Prodinger, “Spanning tree formulas and Chebyshev
polynomials,” Graphs Comb. 2, 191
(1986).
2. X. Chen, “The numbers of spanning trees in undirected circulant graphs,”
J. Zhangzhou Teach. Coll. Nat. Sci. 13:4, 1
(2000).
3. X. Chen, Q. Lin, and F. Zhang, “The number of spanning trees in odd valent
circulant graphs,” Discrete Math. 282, 69
(2004).
4. L. A. Grunwald, Y. S. Kwon, and I. A. Mednykh, “Counting rooted spanning
forests for circulant foliation over a graph,” Tohoku Math. J., Ser. 2 74, 535 (2022).
5. L. A. Grunwald and I. A. Mednykh, “The number of rooted forests in
circulant graphs,” Ars Math. Contemp. 22:4, 10
(2022).