Comment on "The Steiner number of a graph" by G. Chartrand and P. Zhang [Discrete Mathematics 242 (2002) 41-54]

被引:13
作者
Pelayo, IM [1 ]
机构
[1] Univ Politecn Catalunya, Dept Matemat Aplicada 3, ES-08034 Barcelona, Spain
关键词
correction; geodesic; geodetic set; geodetic number; Steiner set; Steiner number;
D O I
10.1016/j.disc.2003.10.016
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We show by counterexample that one of the main results in the paper "The Steiner number of a graph" by Chartrand and Zhang (Disc. Math. 242 (2002) 41-54) does not hold. To be more precise, we prove both that not every Steiner set is a geodetic set and that there are connected graphs whose Steiner number is strictly lower than its geodetic number. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码:259 / 263
页数:5
相关论文
共 3 条
[1]   On the geodetic number of a graph [J].
Chartrand, G ;
Harary, F ;
Zhang, P .
NETWORKS, 2002, 39 (01) :1-6
[2]   The Steiner number of a graph [J].
Chartrand, G ;
Zhang, P .
DISCRETE MATHEMATICS, 2002, 242 (1-3) :41-54
[3]  
Harary F., 1990, Distance in Graphs