The Steiner number of a graph (Q5957746)

From MaRDI portal
scientific article; zbMATH DE number 1719001
Language Label Description Also known as
English
The Steiner number of a graph
scientific article; zbMATH DE number 1719001

    Statements

    The Steiner number of a graph (English)
    0 references
    0 references
    0 references
    24 June 2002
    0 references
    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)\).
    0 references
    0 references
    Steiner distamce
    0 references
    Steiner set
    0 references
    Steiner number
    0 references
    geodetic number
    0 references
    connected graphs
    0 references

    Identifiers