The steiner number of a graph

Discrete Mathematics

Volumn 242, Issue 1-3, 2002, Pages 41-54

  Chartrand, Gary ^a   Zhang, Ping ^a  

^a WESTERN MICHIGAN UNIVERSITY   (United States)

Author keywords

Geodetic number; Steiner distance; Steiner number; Steiner set

Indexed keywords

EID: 31244432715     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00456-8     Document Type: Article

References (13)

1. F. Buckley, F. Harary, Distance in Graphs, Addison-Wesley, Redwood City, CA, 1990.
2. F. Buckley, F. Harary, L.V. Quintas, Extremal results on the geodetic number of a graph, Scientia A2 (1988) 17-26.
3. G. Chartrand, F. Harary, P. Zhang, On the geodetic number of a graph, Networks, to appear.
4. G. Chartrand, O.R. Oellermann, S. Tian, H.B. Zou, Steiner distance in graphs, Casopis Pro Pest. Mat. 114 (1989) 399-410.
5. G. Chartrand, P. Zhang, The forcing geodetic" number of a graph, Discuss. Math. Graph Theory 19 (1999) 45-58.
6. G. Chartrand, P. Zhang, Realizable ratios in graph theory: geodesic parameters, Bull. Inst. Combin. Appl. 27 (1999) 69-80.
7. G. Chartrand, P. Zhang, The geodetic number of an oriented graph, European J. Combin. 21 (2) (2000) 181-189.
8. F. Harary, E. Loukakis, C. Tsouros, The geodetic number of a graph, Math. Comput. Modeling 17 (11) (1993) 89-95.
9. R.M. Karp, Reducibility among combinatorical problems, in: R.E. Miller, J.W. Thatcher (Eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85-103.
10. H.M. Mulder, The Interval Function of a Graph, Methematisch Centrum, Amsterdam, 1980.
11. L. Nebesky , A characterization of the interval function of a connected graph, Czech. Math. J. 44 (119) (1994) 173-178.
12. L. Nebesky , Characterizing of the interval function of a connected graph, Math. Bohem. 123 (1998) 137-144.
13. P.A. Ostrand, Graphs with specified radius and diameter, Discrete Math. 4 (1973) 71-75.