Restrained Steiner Number of Some Special Graphs
A set W of vertices of a graph G is a restrained Steiner set if W is a Steiner set, and if either W=V or the subgraph G[V-W] induced by V-W has no isolated vertices. The minimum cardinality of a restrained Steiner set of G is the restrained Steiner number of G, and is denoted by sr(G). This article explores the restrained Steiner number of some special graphs.
Steiner set, Steiner number, Isolated vertices, Restrained Steiner number, Special graphs.