On the minimum number of vertices and edges in a graph with a given number of spanning trees
Časopis pro pěstování matematiky (1973)
- Volume: 098, Issue: 1, page 95-97
- ISSN: 0528-2195
Access Full Article
top
How to cite
topNebeský, 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 098.1 (1973): 95-97. <http://eudml.org/doc/21146>.
@article{Nebeský1973,
author = {Nebeský, Ladislav},
journal = {Časopis pro pěstování matematiky},
language = {eng},
number = {1},
pages = {95-97},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {On the minimum number of vertices and edges in a graph with a given number of spanning trees},
url = {http://eudml.org/doc/21146},
volume = {098},
year = {1973},
}
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
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 098
IS - 1
SP - 95
EP - 97
LA - eng
UR - http://eudml.org/doc/21146
ER -
References
top- R. G. Busacker T. L. Saaty, Finite Graphs and Networks: An Introduction with Applications, McGraw-Hill, New York 1965. (1965) MR0209176
- O. Ore, Theory of Graphs, Amer. Math. Soc. Colloq. Publ. 38, Providence 1962. (1962) Zbl0105.35401MR0150753
- J. Sedláček, On the minimal graph with a given number of spanning trees, Canad. Math. Bull. 13 (1970), 515-517. (1970) MR0272672
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.