Steiner distance stable graphs (Q1336650)

The authors give a short overview of useful notions and results dealing with Steiner distance stable graphs. They generalize these notions and define \(k\)-vertex \(l\)-edge \((s,m)\)-Steiner distance stable graphs, where \(k\), \(l\), \(s\) and \(m\) are nonnegative integers with \(m\geq s\geq 2\) and \(k\) and \(l\) are not both zero. The authors study relatively hard mathematical problems and also discuss the computational complexity of some of them.