Zhang, Jingyuan; Lu, Fuliang; Jin, Xian’an Counting spanning trees of \((1, N\))-periodic graphs. (English) Zbl 07781868 Discrete Appl. Math. 344, 88-101 (2024). MSC: 05C30 05C05 PDFBibTeX XMLCite \textit{J. Zhang} et al., Discrete Appl. Math. 344, 88--101 (2024; Zbl 07781868) Full Text: DOI arXiv
Mednykh, Alexander; Mednykh, Ilya Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics. (English) Zbl 1504.05141 Ars Math. Contemp. 23, No. 1, Paper No. 8, 16 p. (2023). MSC: 05C30 05C05 05A18 PDFBibTeX XMLCite \textit{A. Mednykh} and \textit{I. Mednykh}, Ars Math. Contemp. 23, No. 1, Paper No. 8, 16 p. (2023; Zbl 1504.05141) Full Text: DOI arXiv
Liu, Jia-Bao; Daoud, S. N. Number of spanning trees in the sequence of some graphs. (English) Zbl 1420.05081 Complexity 2019, Article ID 4271783, 22 p. (2019). MSC: 05C30 05C05 PDFBibTeX XMLCite \textit{J.-B. Liu} and \textit{S. N. Daoud}, Complexity 2019, Article ID 4271783, 22 p. (2019; Zbl 1420.05081) Full Text: DOI
Liu, Jia-Bao; Daoud, Salama Nagy The complexity of some classes of pyramid graphs created from a gear graph. (English) Zbl 1425.05029 Symmetry 10, No. 12, Paper No. 689, 21 p. (2018). MSC: 05C05 05C50 PDFBibTeX XMLCite \textit{J.-B. Liu} and \textit{S. N. Daoud}, Symmetry 10, No. 12, Paper No. 689, 21 p. (2018; Zbl 1425.05029) Full Text: DOI
Daoud, S. N. Complexity of graphs generated by wheel graph and their asymptotic limits. (English) Zbl 1378.05198 J. Egypt. Math. Soc. 25, No. 4, 424-433 (2017). MSC: 05C85 05C05 05C50 PDFBibTeX XMLCite \textit{S. N. Daoud}, J. Egypt. Math. Soc. 25, No. 4, 424--433 (2017; Zbl 1378.05198) Full Text: DOI
Jiang, ZhaoLin; Xu, TingTing Norm estimates of \(\omega\)-circulant operator matrices and isomorphic operators for \(\omega\)-circulant algebra. (English) Zbl 1348.47031 Sci. China, Math. 59, No. 2, 351-366 (2016). MSC: 47C05 42B35 47A50 47C15 15A60 PDFBibTeX XMLCite \textit{Z. Jiang} and \textit{T. Xu}, Sci. China, Math. 59, No. 2, 351--366 (2016; Zbl 1348.47031) Full Text: DOI
Li, Min; Chen, Zhibing; Ruan, Xiaoqing; Yong, Xuerong The formulas for the number of spanning trees in circulant graphs. (English) Zbl 1315.05033 Discrete Math. 338, No. 11, 1883-1906 (2015). MSC: 05C05 PDFBibTeX XMLCite \textit{M. Li} et al., Discrete Math. 338, No. 11, 1883--1906 (2015; Zbl 1315.05033) 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 PDFBibTeX XMLCite \textit{T. Atajan} et al., Discrete Math. 310, No. 6--7, 1210--1221 (2010; Zbl 1230.05097) Full Text: DOI
Golin, Mordecai J.; Yong, Xuerong; Zhang, Yuanping The asymptotic number of spanning trees in circulant graphs. (English) Zbl 1205.05108 Discrete Math. 310, No. 4, 792-803 (2010). MSC: 05C30 05C05 PDFBibTeX XMLCite \textit{M. J. Golin} et al., Discrete Math. 310, No. 4, 792--803 (2010; Zbl 1205.05108) Full Text: DOI
Atajan, Talip; Otsuka, Naohisa; Yong, Xuerong Counting the number of spanning trees in a class of double fixed-step loop networks. (English) Zbl 1202.05062 Appl. Math. Lett. 23, No. 3, 291-298 (2010). MSC: 05C30 68M10 68R10 90C35 PDFBibTeX XMLCite \textit{T. Atajan} et al., Appl. Math. Lett. 23, No. 3, 291--298 (2010; Zbl 1202.05062) 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 PDFBibTeX XMLCite \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 PDFBibTeX XMLCite \textit{T. Atajan} et al., Discrete Math. 306, No. 22, 2817--2827 (2006; Zbl 1131.05048) Full Text: DOI
Chen, Xiebin; Lin, Qiuying; Zhang, Fuji The number of spanning trees in odd valent circulant graphs. (English) Zbl 1042.05051 Discrete Math. 282, No. 1-3, 69-79 (2004). MSC: 05C30 05C05 PDFBibTeX XMLCite \textit{X. Chen} et al., Discrete Math. 282, No. 1--3, 69--79 (2004; Zbl 1042.05051) Full Text: DOI