The Steiner number of a graph (Q5957746): Difference between revisions

Let \(s(G)\) and \(g(G)\) be the Steiner number and geodetic number of a connected graph \(G\), respectively. Connected graphs of order \(n\) with Steiner number \(n\), \(n-1\), or 2 are characterized. Furthermore, for positive integers \(r,d\), and \(s\geq 2\) with \(r\leq d\leq 2r\), the authors present connected graphs of radius \(r\), diameter \(d\), and Steiner number \(s\). In addition, the authors show that every Steiner set in a connected graph \(G\) is also a geodetic set and thus, \(g(G)\leq s(G)\).