Abrosimov, Nikolaĭ Vladimirovich; Baĭgonakova, Gal’ya Amanboldynovna; Grunwald, Liliya Aleksandrovna; Mednykh, Il’ya Aleksandrovich Counting rooted spanning forests in cobordism of two circulant graphs. (English) Zbl 1444.05066 Sib. Èlektron. Mat. Izv. 17, 814-823 (2020). MSC: 05C30 05C75 39A10 PDF BibTeX XML Cite \textit{N. V. Abrosimov} et al., Sib. Èlektron. Mat. Izv. 17, 814--823 (2020; Zbl 1444.05066) Full Text: DOI
Mednykh, A. D.; Mednykh, I. A. The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic. (English) Zbl 1414.05080 Discrete Math. 342, No. 6, 1772-1781 (2019). MSC: 05C05 PDF BibTeX XML Cite \textit{A. D. Mednykh} and \textit{I. A. Mednykh}, Discrete Math. 342, No. 6, 1772--1781 (2019; Zbl 1414.05080) Full Text: DOI
Mednykh, Ilya A. On Jacobian group and complexity of \(I\)-graph \(I(n, k, l)\) through Chebyshev polynomials. (English) Zbl 1411.05126 Ars Math. Contemp. 15, No. 2, 467-485 (2018). MSC: 05C30 39A10 PDF BibTeX XML Cite \textit{I. A. Mednykh}, Ars Math. Contemp. 15, No. 2, 467--485 (2018; Zbl 1411.05126) Full Text: DOI
Abrosimov, N. V.; Baigonakova, G. A.; Mednykh, I. A. Counting spanning trees in cobordism of two circulant graphs. (English) Zbl 1398.05058 Sib. Èlektron. Mat. Izv. 15, 1145-1157 (2018). MSC: 05C05 05C31 05C75 05C30 39A10 PDF BibTeX XML Cite \textit{N. V. Abrosimov} et al., Sib. Èlektron. Mat. Izv. 15, 1145--1157 (2018; Zbl 1398.05058) Full Text: DOI
Mednykh, A. D.; Mednykh, Ilya A. Asymptotics and arithmetical properties of complexity for circulant graphs. (English. Russian original) Zbl 1391.05150 Dokl. Math. 97, No. 2, 147-151 (2018); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 479, No. 4, 363-367 (2018). MSC: 05C40 05C05 PDF BibTeX XML Cite \textit{A. D. Mednykh} and \textit{I. A. Mednykh}, Dokl. Math. 97, No. 2, 147--151 (2018; Zbl 1391.05150); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 479, No. 4, 363--367 (2018) Full Text: DOI
Kwon, Y. S.; Mednykh, A. D.; Mednykh, I. A. On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials. (English) Zbl 1365.05135 Linear Algebra Appl. 529, 355-373 (2017). MSC: 05C30 39A10 PDF BibTeX XML Cite \textit{Y. S. Kwon} et al., Linear Algebra Appl. 529, 355--373 (2017; Zbl 1365.05135) Full Text: DOI
Daoud, S. N. Number of spanning trees of different products of complete and complete bipartite graphs. (English) Zbl 1407.05128 Math. Probl. Eng. 2014, Article ID 965105, 23 p. (2014). MSC: 05C30 05C05 PDF BibTeX XML Cite \textit{S. N. Daoud}, Math. Probl. Eng. 2014, Article ID 965105, 23 p. (2014; Zbl 1407.05128) Full Text: DOI
Wu, Mei-Hui; Chung, Long-Yeu The number of spanning trees of the Cartesian product of regular graphs. (English) Zbl 1407.05057 Math. Probl. Eng. 2014, Article ID 750618, 9 p. (2014). MSC: 05C05 05C30 PDF BibTeX XML Cite \textit{M.-H. Wu} and \textit{L.-Y. Chung}, Math. Probl. Eng. 2014, Article ID 750618, 9 p. (2014; Zbl 1407.05057) Full Text: DOI
Ozeki, Kenta; Yamashita, Tomoki Spanning trees: A survey. (English) Zbl 1232.05055 Graphs Comb. 27, No. 1, 1-26 (2011). Reviewer: Mikhail Ostrovskii (Queens) MSC: 05C05 05-02 05C12 05C45 PDF BibTeX XML Cite \textit{K. Ozeki} and \textit{T. Yamashita}, Graphs Comb. 27, No. 1, 1--26 (2011; Zbl 1232.05055) Full Text: DOI
Atajan, Talip; Yong, Xuerong; Inaba, Hiroshi An efficient approach for counting the number of spanning trees in circulant and related graphs. (English) Zbl 1230.05097 Discrete Math. 310, No. 6-7, 1210-1221 (2010). MSC: 05C05 05C30 PDF BibTeX XML Cite \textit{T. Atajan} et al., Discrete Math. 310, No. 6--7, 1210--1221 (2010; Zbl 1230.05097) Full Text: DOI
Chen, Xiebin The number of spanning trees in directed circulant graphs with non-fixed jumps. (English) Zbl 1143.05041 Discrete Math. 307, No. 15, 1873-1880 (2007). Reviewer: Ulrich Knauer (Oldenburg) MSC: 05C30 05C05 PDF BibTeX XML Cite \textit{X. Chen}, Discrete Math. 307, No. 15, 1873--1880 (2007; Zbl 1143.05041) Full Text: DOI
Atajan, Talip; Yong, Xuerong; Inaba, Hiroshi Further analysis of the number of spanning trees in circulant graphs. (English) Zbl 1131.05048 Discrete Math. 306, No. 22, 2817-2827 (2006). Reviewer: Peter Kirschenhofer (Leoben) MSC: 05C30 05C05 PDF BibTeX XML Cite \textit{T. Atajan} et al., Discrete Math. 306, No. 22, 2817--2827 (2006; Zbl 1131.05048) Full Text: DOI