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
来源：
UKRAINIAN MATHEMATICAL JOURNAL | 2024年 / 76卷 / 05期
关键词：
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
相关论文
共 50 条
[21]   Total Restrained Geodetic Number of Graphs [J].
Hossein Abdollahzadeh Ahangar ;
Maryam Najimi .
Iranian Journal of Science and Technology, Transactions A: Science, 2017, 41 :473-480
[22]   Total Restrained Geodetic Number of Graphs [J].
Ahangar, Hossein Abdollahzadeh ;
Najimi, Maryam .
IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION A-SCIENCE, 2017, 41 (A2) :473-480
[23]   Strong Geodetic Number of Complete Bipartite Graphs, Crown Graphs and Hypercubes [J].
Valentin Gledel ;
Vesna Iršič .
Bulletin of the Malaysian Mathematical Sciences Society, 2020, 43 :2757-2767
[24]   Strong Geodetic Number of Complete Bipartite Graphs and of Graphs with Specified Diameter [J].
Irsic, Vesna .
GRAPHS AND COMBINATORICS, 2018, 34 (03) :443-456
[25]   Strong Geodetic Number of Complete Bipartite Graphs, Crown Graphs and Hypercubes [J].
Gledel, Valentin ;
Irsic, Vesna .
BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2020, 43 (03) :2757-2767
[26]   Strong Geodetic Number of Complete Bipartite Graphs and of Graphs with Specified Diameter [J].
Vesna Iršič .
Graphs and Combinatorics, 2018, 34 :443-456
[27]   PRODUCTS OF GEODESIC GRAPHS AND THE GEODETIC NUMBER OF PRODUCTS [J].
Soloff, Jake A. ;
Marquez, Rommy A. ;
Friedler, Louis M. .
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2015, 35 (01) :35-42
[28]   Toll number of the Cartesian and the lexicographic product of graphs [J].
Gologranc, Tanja ;
Repolusk, Polona .
DISCRETE MATHEMATICS, 2017, 340 (10) :2488-2498
[29]   ON THE HULL NUMBER OF TRIANGLE-FREE GRAPHS [J].
Dourado, Mitre C. ;
Protti, Fabio ;
Rautenbach, Dieter ;
Szwarcfiter, Jayme L. .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 23 (04) :2163-2172
[30]   Detour Number of 1-Fault Connected Graphs [J].
Raghu, T. Venkata ;
Rajan, R. Sundara ;
Babu, A. Ramesh ;
Anil, S. .
FUNDAMENTA INFORMATICAE, 2020, 172 (01) :97-104
12345