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

142 BIBLIOGRAPHY[107] R. Shrock and F. Y. Wu, Spanning Trees on graphs and lattices in d dimensions,J. Phys A33 (2000), 3881 - 3902.[108] R. P. Stanley, Enumerative Combinatorics, Vol. 1, Cambridge University Press,Cambridge, 1997.[109] R. P. Stanley, Enumerative Combinatorics, Vol. 2, Cambridge University Press,London, 1999.[110] R. P. Stanley, Spanning trees of Aztec diamond, Discrete Mathematics, 157(1996), 375 - 388.[111] H. Temperley, On the mutual cancellation of cluster integrals in Mayer’s fugacityseries, Proc. Phys. Soc. Lond., (A) 83 (1964), 3 - 16.[112] C. Thomassen, Spanning trees and orientations of graphs, Journal of Combinatorics,Vol. 1, no. 2, pp. 101 - 111, 2010.[113] J. H. van Lint, R. M. Wilson, A course in Combinatorics, Cambridge UniversityPress, London, 1992.[114] D. G. Wagner, Combinatorics of electrical networks, Lecture notes, 2009.[115] H. Wang, The extremal values of the Wiener index of a tree with given degreeSequence, Discrete Applied Mathematics, 156 (2009) 2647 - 2654.[116] L. Weinberg, Number of Trees in a Graph, Proc. IRE, 46 (1958), 1945 - 1955.[117] D. B. West, Introduction to Graph Theory. Second Edition, Prentice Hall, 2002.[118] R. J. Wilson, Introduction to Graph Theory, 4th ed., Longman, 1996.[119] D. K. Wind and H. W. Vildhøj, Supplementary Notes for Graph Theory I.DRAFT Compiled, jun 2011.[120] F. Y. Wu, Number of spanning trees on a lattice, J. Physics, A: Mathematical andGeneral 10 (1977), L113 - 115.[121] J. Xu, Theory and Application of Graphs, Kluwer Academic Publishers, Dordrecht/Boston/London,2003.[122] W. M. Yan, W. Myrvold, K. L. Chung, A formula for the number of spanningtrees of a multi-star related graph, Information Processing Letters, 68 (1998), 295 -298.[123] X. Yong, Talip, Acenjian, The Number of Spanning trees of the Cubic CycleCN 3 and the Quadruple Cycle C4 N , Discrete Mathematics, 169 (1997), 293 - 298.