1. Kirchhoff G., “Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme geführt wird”, Ann. Phys. Chem., 72:12 (1847), 497-508. DOI: 10.1002/andp.18471481202
2. Kel’mans A.K., Chelnokov V.M., “A certain polynomial of a graph and graphs with an extremal number of trees”, J. Combin. Theory (B), 16 (1974), 197-214. DOI: 10.1016/0095-8956(74)90065-3 EDN: XOODQI MathSciNet: 345867
3. Mednykh A.D., Mednykh I.A., “Asymptotics and arithmetical properties of complexity for circulant graphs”, Dokl. Math., 97:2 (2018), 147-151. DOI: 10.1134/S1064562418020138 EDN: XXZCLB MathSciNet: 3838534
4. Grunwald L.A., Mednykh I.A., “The number of rooted forests in circulant graphs”, Ars Math. Contemp., 22:4 (2022), 4-10. DOI: 10.26493/1855-3974.2029.01d EDN: ARVEBR MathSciNet: 4498581
5. Kwon Y.S., Mednykh A.D., Mednykh I.A., “On the structure of Laplacian characteristic polynomial of circulant graphs”, Dokl. Math., 109:1 (2024), 25-29. DOI: 10.1134/S1064562424701771 EDN: MLOCKY MathSciNet: 4748439
6. Knill O., “Cauchy-Binet for pseudo-determinants”, Linear Algebra Appl., 459 (2014), 522-547. DOI: 10.1016/j.laa.2014.07.013 EDN: KSHSEH MathSciNet: 3247242
7. Chen X., Lin Q., Zhang F., “The number of spanning trees in odd valent circulant graphs”, Discrete Math., 282 (2004), 69-79. DOI: 10.1016/j.disc.2003.12.006 MathSciNet: 2059507
8. Golin M.J., Yong X., Zhang Y., “The asymptotic number of spanning trees in circulant graphs”, Discrete Math., 310 (2010), 792-803. DOI: 10.1016/j.disc.2009.09.008 MathSciNet: 2574828
9. Li M., Chen Z., Ruan X., Yong X., “The formulas for the number of spanning trees in circulant graphs”, Discrete Math., 338 (2015), 1883-1906. DOI: 10.1016/j.disc.2015.02.006 MathSciNet: 3357775
10. Louis J., “A formula for the number of spanning trees in circulant graphs with non-fixed generators and discrete tori”, Bull. Aust. Math. Soc., 92 (2015), 365-373. DOI: 10.1017/S0004972715000969 MathSciNet: 3415612
11. Zhang Y., Yong X., Golin M.J., “Chebyshev polynomials and spanning tree formulas for circulant and related graphs”, Discrete Math., 298 (2005), 334-364. DOI: 10.1016/j.disc.2004.10.025 EDN: VBJWBF MathSciNet: 2163455
12. Mednykh A., Mednykh I., “Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics”, Ars Math. Contemp., 23:1 (2023), 8-16. MathSciNet: 3439936
13. Yuanping Zhang, Xuerong Yong, Golin M.J., “The number of spanning trees in circulant graphs”, Discrete Math., 223:1-3 (2000), 337-350. DOI: 10.1016/S0012-365X(99)00414-8 MathSciNet: 1782058
14. Xiebin Chen, Qiuying Lin, Fuji Zhang, “The number of spanning trees in odd valent circulant graphs”, Discrete Math., 282:1-3 (2004), 69-79. DOI: 10.1016/j.disc.2003.12.006 MathSciNet: 2059507
15. Mednykh A.D. Mednykh I.A., “The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic”, Discrete Math., 342:6 (2019), 1772-1781. DOI: 10.1016/j.disc.2018.08.030 EDN: TYEJVM MathSciNet: 3922465
16. Mason J.C., Handscomb D.C., Chebyshev Polynomials, CRC Press, Boca Raton, 2003. MathSciNet: 1937591
17. Davis P.J., Circulant Matrices, AMS Chelsea Publishing, 1994. MathSciNet: 543191
18. Lorenzini D., “Smith normal form and Laplacians”, J. Comb. Theory (B), 98 (2008), 1271-1300. DOI: 10.1016/j.jctb.2008.02.002 MathSciNet: 2462319
