共 50 条
Graphs with Large Steiner Number
被引:0
|作者:
John, J.
[1
]
Raj, M. S. Malchijah
[2
]
机构:
[1] Govt Coll Engn, Dept Math, Tirunelveli, India
[2] Saveetha Univ, Saveetha Inst Med & Tech Sci, Saveetha Sch Engn, Dept Math, Chennai, Tamil Nadu, India
关键词:
GEODETIC NUMBER;
ANALOGIES;
D O I:
10.1007/s11253-024-02354-3
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
In 2002, G. Chartrand and P. Zhang [Discrete Math., 242, 4 (2002)] characterized the connected graphs G of order p >= 3 with Steiner number p, p - 1, or 2. We characterize all connected graphs G of order p >= 4 with Steiner number s(G) = p - 2. In addition, we obtain some sharp Nordhaus-Gaddum bounds for the Steiner number of connected graphs whose complement is also connected.
引用
收藏
页码:805 / 815
页数:11
相关论文