Steiner distance stable graphs (Q1336650)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Steiner distance stable graphs |
scientific article |
Statements
Steiner distance stable graphs (English)
0 references
20 March 1995
0 references
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.
0 references
Steiner distance stable grahs
0 references
computational complexity
0 references