Article PDF
Avoid common mistakes on your manuscript.
References
Austin, T.L.: The enumeration of point labelled chromatic graphs and trees. Canad. J. Math.12, 535–545 (1960)
Berge, C.: Graphs and Hypergraphs, chapter 3. Amsterdam-London: North-Holland 1973
Berman, A., Plemmons, R.J.: Nonnegative matrices in the mathematical sciences. New York-London: Academic Press 1979
Biggs, N.: Algebraic Graph Theory. Cambridge: Cambridge University Press 1974
Biggs, N.L., Lloyd, E.K., Wilson, R.J.: Graph Theory 1736–1936. Oxford: Clarendon Press 1976
Cayley, A.: A theorem on trees. Quart. J. Pure Math.23, 376–378 (1889)
Clarke, L.E.: On Cayley's Formula for counting Trees. J. London Math. Soc.33, 471–474 (1958)
Dziobek, D.: Eine Formel der Substitutionstheorie. Sitzungsber. Berliner Math. Gesellsch.17, 64–67 (1917)
Fiedler, M., Ptak, V.: On matrices with non-positive off-diagonal elements and positive principal minors. Czechoslovak Math. J.12, 382–400 (1962)
Harary, F.: Graph Theory. Reading, Mass.: Addison-Wesley 1972
Hutschenreuther, H.: Einfacher Beweis des „Matrix-Gerüst-Satzes” der Netzwerktheorie. Wiss. z. Techn. Hochsch. Ilmenau13, 403–404 (2967)
Kirchhoff, G.: Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird. Ann. Phys. Chem.72, 497–508 (1847)
Marcus, M., Minc, H.: A survey of Matrix Theory and Matrix Inequalities. Boston: Prindle, Weber & Schmidt 1964
Moon, J.W.: Various Proofs of Cayley's Formula for Counting Trees. In: A Seminar on Graph Theory (F. Harary, ed.) (London 1963), pp. 70–78. New York-Toronto-London: Holt, Rinehart and Winston 1967
Moon, J.W.: Enumerating Labelled Trees. In: Graph Theory and Theoretical Physics (F. Harary, ed.). NATO Advanced Study Institute (Paris 1963), pp. 267–271. London-New York: Academic Press 1967
O'Neil, P.V.: The number of trees in a certain network. Notices Amer. Math. Soc.10, 569 (1963)
Prüfer, H.: Neuer Beweis eines Satzes über Permutationen. Arch. Math. Phys.27, 142–144 (1918)
Rényi, A.: Some remarks on the Theory of Trees. Magyar Tud. Akad. Mat. Kutató Int. Közl.4, 73–85 (1959)
Scoins, H.I.: The Number of Trees with Nodes of Alternate Parity. Proc. Cambridge Philos. Soc.58, 12–16 (1962)
Smith, R.L.: Factorization of Symmetric SingularM-Matrices. Linear Algebra and Appl.23, 253–259 (1979)
Temperley, H.N.V.: On the Mutual Cancellation of Cluster Integrals. Proc. Phys. Soc.83, 3–16 (1964)
Trent, H.M.: A note on the enumeration and listing of all possible trees in a connected linear graph. Proc. Nat. Acad. Sci. U.S.A.40, 1004–1007 (1954)
Weinberg, L.: Number of trees in a graph. Proc. IRE46, 1954–1955 (1958)
Chaiken, S., Kleitman, D.J.: Matrix Tree Theorems, J. Comb. Theory (Ser A),24, 377–381 (1978)
Chaiken, S.: A combinatorial proof of the All Minors Matrix Tree Theorem, to appear
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lewin, M. A generalization of the matrix-tree theorem. Math Z 181, 55–70 (1982). https://doi.org/10.1007/BF01214981
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01214981