On the minimum number of vertices and edges in a graph with a given number of spanning trees
Časopis pro pěstování matematiky, Tome 98 (1973) no. 1, pp. 95-97
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
Nebeský, Ladislav. On the minimum number of vertices and edges in a graph with a given number of spanning trees. Časopis pro pěstování matematiky, Tome 98 (1973) no. 1, pp. 95-97. doi: 10.21136/CPM.1973.117780
@article{10_21136_CPM_1973_117780,
author = {Nebesk\'y, Ladislav},
title = {On the minimum number of vertices and edges in a graph with a given number of spanning trees},
journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
pages = {95--97},
year = {1973},
volume = {98},
number = {1},
doi = {10.21136/CPM.1973.117780},
mrnumber = {0317998},
zbl = {0251.05120},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1973.117780/}
}
TY - JOUR AU - Nebeský, Ladislav TI - On the minimum number of vertices and edges in a graph with a given number of spanning trees JO - Časopis pro pěstování matematiky PY - 1973 SP - 95 EP - 97 VL - 98 IS - 1 UR - http://geodesic.mathdoc.fr/articles/10.21136/CPM.1973.117780/ DO - 10.21136/CPM.1973.117780 LA - en ID - 10_21136_CPM_1973_117780 ER -
%0 Journal Article %A Nebeský, Ladislav %T On the minimum number of vertices and edges in a graph with a given number of spanning trees %J Časopis pro pěstování matematiky %D 1973 %P 95-97 %V 98 %N 1 %U http://geodesic.mathdoc.fr/articles/10.21136/CPM.1973.117780/ %R 10.21136/CPM.1973.117780 %G en %F 10_21136_CPM_1973_117780
[1] R. G. Busacker T. L. Saaty: Finite Graphs and Networks: An Introduction with Applications. McGraw-Hill, New York 1965. | MR
[2] O. Ore: Theory of Graphs. Amer. Math. Soc. Colloq. Publ. 38, Providence 1962. | MR | Zbl
[3] J. Sedláček: On the minimal graph with a given number of spanning trees. Canad. Math. Bull. 13 (1970), 515-517. | MR
Cité par Sources :