A characterization of 3-Steiner distance
β
Day, D. P.; Oellermann, Ortrud R.; Swart, Henda C.
π
Article
π
1997
π
John Wiley and Sons
π
English
β 174 KB
π 1 views
Let G be a connected graph and S β V (G). Then, the Steiner distance of S in G, denoted by d G (S), is the smallest number of edges in a connected subgraph of G that contains . Some general properties about the cycle structure of k-Steiner distance hereditary graphs are established. These are then