Journal of Information Science and Engineering, Vol. 35 No. 4, pp. 721-735

Steiner Distance in Join, Corona, Cluster, and Threshold Graphs

For a connected graph *G* and a subset *S* of its vertices, the Steiner tree problem consists of finding a minimum-size connected subgraph containing *S*. The Steiner distance of *S* is the size of a Steiner tree for *S*, and the Steiner *k*-diameter of *G* is the maximum value of the Steiner distance over all vertex subsets *S* of cardinality* k*. Calculation of Steiner trees and Steiner distance is known to be NP-hard in general, so applications may benefit from using graphs where the Steiner distance and structure of Steiner trees are known. In this paper, we investigate the Steiner distance and Steiner *k*-diameter of the join, corona, and cluster of connected graphs, as well as threshold graphs.

Keywords:
wireless sensor networks, localization, mobile beacon, mobile anchor, RSSI