On the number of spanning trees of finite graphs
Časopis pro pěstování matematiky (1969)
- Volume: 094, Issue: 2, page 217-221
- ISSN: 0528-2195
Access Full Article
top
How to cite
topSedláček, Jiří. "On the number of spanning trees of finite graphs." Časopis pro pěstování matematiky 094.2 (1969): 217-221. <http://eudml.org/doc/21020>.
@article{Sedláček1969,
author = {Sedláček, Jiří},
journal = {Časopis pro pěstování matematiky},
keywords = {topology},
language = {eng},
number = {2},
pages = {217-221},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {On the number of spanning trees of finite graphs},
url = {http://eudml.org/doc/21020},
volume = {094},
year = {1969},
}
TY - JOUR
AU - Sedláček, Jiří
TI - On the number of spanning trees of finite graphs
JO - Časopis pro pěstování matematiky
PY - 1969
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 094
IS - 2
SP - 217
EP - 221
LA - eng
KW - topology
UR - http://eudml.org/doc/21020
ER -
References
top- C. Berge, Théorie des graphes et ses applications, Paгis 1958. (1958)
- D. K. Fаddějev, V. N. Fаddӗjevová, Numerické metody lineární algebгy (Numerical methods of linear algebra), Praha 1964. (1964)
- J. W. Moon, The second moment of the complexity of a graph, Mathematika II (1964), 95-98. (1964) Zbl0134.43504MR0175115
- A. Rotkiewicz, On Lucas numbers with two intrinsic prime divisors, Bulletin de ľАcadémie polonaise des sciences, X. (1962), 229-232. (1962) Zbl0136.32503MR0139592
- J. Sedláček, O kostrách konečných grafů (On the spanning trees of finite graphs), Časopis pro péstování matematiky, 9I (1966), 221 - 227. (1966) MR0195763
Citations in EuDML Documents
topNotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.