Geodesic
On the number of spanning trees of finite graphs
Časopis pro pěstování matematiky, Tome 94 (1969) no. 2, pp. 217-221

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

DOI MR   Zbl

DOI : 10.21136/CPM.1969.117654
Classification : 05-45 
Sedláček, Jiří. On the number of spanning trees of finite graphs. Časopis pro pěstování matematiky, Tome 94 (1969) no. 2, pp. 217-221. doi: 10.21136/CPM.1969.117654
@article{10_21136_CPM_1969_117654,
     author = {Sedl\'a\v{c}ek, Ji\v{r}{\'\i}},
     title = {On the number of spanning trees of finite graphs},
     journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
     pages = {217--221},
     year = {1969},
     volume = {94},
     number = {2},
     doi = {10.21136/CPM.1969.117654},
     mrnumber = {0250931},
     zbl = {0175.20902},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1969.117654/}
}
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
SP  - 217
EP  - 221
VL  - 94
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CPM.1969.117654/
DO  - 10.21136/CPM.1969.117654
LA  - en
ID  - 10_21136_CPM_1969_117654
ER  - 
%0 Journal Article
%A Sedláček, Jiří
%T On the number of spanning trees of finite graphs
%J Časopis pro pěstování matematiky
%D 1969
%P 217-221
%V 94
%N 2
%U http://geodesic.mathdoc.fr/articles/10.21136/CPM.1969.117654/
%R 10.21136/CPM.1969.117654
%G en
%F 10_21136_CPM_1969_117654

[1] C. Berge: Théorie des graphes et ses applications. Paгis 1958.

[2] D. K. Fаddějev, V. N. Fаddӗjevová: Numerické metody lineární algebгy (Numerical methods of linear algebra). Praha 1964.

[3] J. W. Moon: The second moment of the complexity of a graph. Mathematika II (1964), 95-98. | MR | Zbl

[4] A. Rotkiewicz: On Lucas numbers with two intrinsic prime divisors. Bulletin de ľАcadémie polonaise des sciences, X. (1962), 229-232. | MR | Zbl

[5] 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. | MR

Cité par Sources :