enumeration of the number of spanning trees in some ... - Toubkal

136 BIBLIOGRAPHY[13] N. Biggs, E. Lloyd and R. Wilson, Graph Theory, 1736 - 1936, Clarendon Press,Oxford 1976.[14] F. T. Boesch, H. Prodinger, Spanning Trees Formulas and Chebyshev Polynomials,Graph and Combinatorics, 2 (1986), 191 - 200.[15] F. T. Boesch, J. F. Wang, A Conjecture on the Number of Spanning Trees in theSquare of a Cycle, In: Notes from New York Graph Theory Day V, P. 16, New York:New York Academy Sciences, 1982.[16] Z. R. Bogdanowicz, Formulas for the Number of Spanning Trees in a Fan , AppliedMathematical Sciences, Vol. 2, 2008, no. 16, 781 - 786.[17] B. Bollobás, Modern Graph Theory, Springer, 2002.[18] B. Bollobás, Extremal Graph Theory, Academic Press Inc., London, 1978.[19] J. A. Bondy and U. S. R. Murty, Graph Theory, Springer, 2008.[20] J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, AmericanElsevier, New York, 1976.[21] A. E. Brouwer and W. H. Haemers, Spectra of graphs, Springer, 2011[22] T.J.N. Brown, R.B. Mallion, P. Pollak, and A. Roth, Some methods forcounting the spanning trees in labelled molecular graphs, examined in relation tocertain fullerenes, Discrete Applied Mathematics, 67 (1996), no. 1-3, 51 - 66.[23] F. Buckley, F. Harary, Distance in Graphs, Addison-Wesley, Reading, MA, 1990.[24] G. A. Cayley, A Theorem on Trees. Quart. J. Math., 23, (1889) 276-378.[25] A. Cayley, On the theory of analytical forms called trees, Philadelphia Magazine,13 (1857), 172 - 176.[26] G. Chartrand, L. Lesniak, Graphs and digraphs, 3rd edition, Chapman & Hall,1996.[27] T. Chow, The Q-Spectrum and Spanning Trees of Tensor Products of BipartiteGraphs, Proc. Amer. Math. Soc. 125 (1997), 3155 - 3161.[28] F.R.K. Chung, Diameters of Communication Networks, Mathematics Subject classification,Bell Communications Research, Morristown, 1980, New Jersey.[29] F. R. K. Chung and R. P. Langlands, A combinatorial Laplacian with vertexweights, J. Comb. Theory, (A), 75 (1996), 316 - 327.[30] K. L. Chung, W. M. Yan, On the number of spanning trees of a multi-complete/starrelated graph, Information Processing Letters, 76 (2000), 113 - 119.