Publisher
Springer Science and Business Media LLC
Reference13 articles.
1. Aigner, M.: A Course in Enumeration, Graduate Texts in Mathematics, vol. 238. Springer, Berlin (2007)
2. Atajan, T., Otsuka, N., Yong, X.: Counting the number of spanning trees in a class of double fixed-step loop networks. Appl. Math. Lett. 23(3), 291–298 (2010). doi:
10.1016/j.aml.2009.04.006
3. Atajan, T., Yong, X., Inaba, H.: Further analysis of the number of spanning trees in circulant graphs. Discrete Math. 306(22), 2817–2827 (2006). doi:
10.1016/j.disc.2006.05.024
4. Biggs, N.: Algebraic Graph Theory, Cambridge Mathematical Library. Cambridge University Press, Cambridge (1993)
5. Chen, X.: The number of spanning trees in directed circulant graphs with non-fixed jumps. Discrete Math. 307(15), 1873–1880 (2007). doi:
10.1016/j.disc.2006.09.034