Steiner distance in graphs
Gary Chartrand; Ortrud R. Oellermann; Song Lin Tian; Hung Bin Zou
Časopis pro pěstování matematiky (1989)
- Volume: 114, Issue: 4, page 399-410
- ISSN: 0528-2195
Access Full Article
top
How to cite
topChartrand, Gary, et al. "Steiner distance in graphs." Časopis pro pěstování matematiky 114.4 (1989): 399-410. <http://eudml.org/doc/21761>.
@article{Chartrand1989,
author = {Chartrand, Gary, Oellermann, Ortrud R., Tian, Song Lin, Zou, Hung Bin},
journal = {Časopis pro pěstování matematiky},
keywords = {distance; eccentricity; radius; diameter},
language = {eng},
number = {4},
pages = {399-410},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {Steiner distance in graphs},
url = {http://eudml.org/doc/21761},
volume = {114},
year = {1989},
}
TY - JOUR
AU - Chartrand, Gary
AU - Oellermann, Ortrud R.
AU - Tian, Song Lin
AU - Zou, Hung Bin
TI - Steiner distance in graphs
JO - Časopis pro pěstování matematiky
PY - 1989
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 114
IS - 4
SP - 399
EP - 410
LA - eng
KW - distance; eccentricity; radius; diameter
UR - http://eudml.org/doc/21761
ER -
References
top- G. Chartrand L. Lesniak, Graphs & Digraphs, 2nd Edition. Monterey, CA (1986). (1986) MR0834583
- F. Harary, The maximum connectivity of a graph, Proc. Acad. Sci. USA 48 (1962) 1142- 1146. (1962) Zbl0115.41003MR0137663
- R. M. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations (eds., R. E. Miller and J. W. Thatcher). Plenum Press, New York (1972) 85-103. (1972) MR0378476
- O. R. Oellermann S. Tian, Steiner centers in graphs, J. Graph Theory (to appear). MR1073100
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.