Steiner distance in graphs
Časopis pro pěstování matematiky, Tome 114 (1989) no. 4, pp. 399-410
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
Chartrand, Gary; Oellermann, Ortrud R.; Tian, Song Lin; Zou, Hung Bin. Steiner distance in graphs. Časopis pro pěstování matematiky, Tome 114 (1989) no. 4, pp. 399-410. doi: 10.21136/CPM.1989.118395
@article{10_21136_CPM_1989_118395,
author = {Chartrand, Gary and Oellermann, Ortrud R. and Tian, Song Lin and Zou, Hung Bin},
title = {Steiner distance in graphs},
journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
pages = {399--410},
year = {1989},
volume = {114},
number = {4},
doi = {10.21136/CPM.1989.118395},
mrnumber = {1027236},
zbl = {0688.05040},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1989.118395/}
}
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 SP - 399 EP - 410 VL - 114 IS - 4 UR - http://geodesic.mathdoc.fr/articles/10.21136/CPM.1989.118395/ DO - 10.21136/CPM.1989.118395 LA - en ID - 10_21136_CPM_1989_118395 ER -
%0 Journal Article %A Chartrand, Gary %A Oellermann, Ortrud R. %A Tian, Song Lin %A Zou, Hung Bin %T Steiner distance in graphs %J Časopis pro pěstování matematiky %D 1989 %P 399-410 %V 114 %N 4 %U http://geodesic.mathdoc.fr/articles/10.21136/CPM.1989.118395/ %R 10.21136/CPM.1989.118395 %G en %F 10_21136_CPM_1989_118395
[1] G. Chartrand L. Lesniak: Graphs & Digraphs. 2nd Edition. Monterey, CA (1986). | MR
[2] F. Harary: The maximum connectivity of a graph. Proc. Acad. Sci. USA 48 (1962) 1142- 1146. | MR | Zbl
[3] 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. | MR
[4] O. R. Oellermann S. Tian: Steiner centers in graphs. J. Graph Theory (to appear). | MR
Cité par Sources :