The forcing edge fixed steiner number of a graph
M. Perumalsamy, P. Arul Paul Sudhahar, R. Vasanthi, J. John · Journal of Statistics and Management Systems · 2019
Let G be a simple connected graph with at least 3 vertices and W be an edge fixed steiner set of G[6]. A subset T ⊆ W is called an edge fixed forcing subset for W if W is the unique Se – set containing T. In this paper, we introduce the parameter forcing edge fixed steiner number of G and determine the same for some standard graphs. Also we find the bounds for this parameter and prove the existence theorem.