Previous |  Up |  Next

Article

Title: Poznámka o počtu koster grafu (Czech)
Title: A note on the number of spanning trees of a graph (English)
Author: Rohlíčková, Iva
Language: Czech
Journal: Časopis pro pěstování matematiky
ISSN: 0528-2195
Volume: 91
Issue: 1
Year: 1966
Pages: 89-91
Summary lang: English
Summary lang: Russian
.
Category: math
.
MSC: 05-45
idZBL: Zbl 0151.33303
idMR: MR0190034
DOI: 10.21136/CPM.1966.117545
.
Date available: 2009-09-23T07:45:22Z
Last updated: 2020-07-28
Stable URL: http://hdl.handle.net/10338.dmlcz/117545
.
Reference: [1] A. Cayley: Collected Mathematical Papers.(1889-1897), Cambridge University Press, Vol. 13, pp. 26-28. Zbl 0099.00101
Reference: [2] H. M. Trent: A Note on the Enumeration and Listing of all possible Trees in a conected linear Graph.Proc. Natl. Acad. Sci., Vol. 40, pp. 1004-1007, October 1954. MR 0067466
Reference: [3] L. Weinberg: Number of Trees in a Graph.Proc. IRE, Vol. 46 No. 12, pp. 1954-1955, Dec., 1958.
Reference: [4] M. Fiedler J. Sedláček: O W-basích orientovaných grafů.Časopis pro pěstování matematiky, 83 (1958), 214-225. MR 0097071
Reference: [5] T. Austin: The Enumeration of Point labelled chromatic Graphs and Trees.Canadian Journal Math. XII - 1960, 535-545. Zbl 0096.17802, MR 0139544
Reference: [6] I. Rohlíčková: Dva doplňky ke Cayleyho vzorci.Sborník Pedagogického institutu v Praze, Přírodní vědy, 1961, str. 21-34.
Reference: [7] S. D. Bedrosian: Formulas for the Number of Trees in a Network.IRE Trans. on Circuit Theory, Vol. CT-8, pp. 363-364, Sept. 1961.
Reference: [8] P. V. O’Neil: The Number of Trees in a Certain Network.presented at Meeting No. 604, Am. Math. Soc., Brooklyn, N.Y., Oct., 1963.
Reference: [9] S. D. Bedrosian: Generating Formulas for the Number of Trees in a Graph.Journal of The Franklin Institute, Vol. 277, Nr. 4, pp. 313-326, April 1964. Zbl 0135.41904, MR 0162240
.

Files

Files Size Format View
CasPestMat_091-1966-1_11.pdf 585.0Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo