Authors : Shantanu Agrawal, Shashank Bhalotial and M.B. Chandak
Abstract: In graph the two main components are Vertices and Edges. The vertices are connected using edges. There are two types of graphs, directed and undirected. The major application of graph is representing network on paper. The cost involved in converting paper based network to actual cable based network is majorly controlled by cables required for connection. The cost can be reduced if the length of cable can be reduced. The paper describes, methodology to compute steiner point. Using steiner point it is possible to modify the position of vertices, so as to reduce the cable length, keeping the vertex connectivity intact. The study describes implementation of steiner point on graph with number of vertices-3,4,5,6, etc. The presented work can be applied for graph with any number of vertices. It is optimization approach to reduce the cable size and cost of implementation of network.
Shantanu Agrawal, Shashank Bhalotial and M.B. Chandak, 2020. A Novel Approach to Compute Steiner Point in Graph: Application for Network Design. Asian Journal of Information Technology, 19: 242-248.