Edge fixed edge Steiner number of a graph. Issue 4 (13th August 2019)

• Record Type: Journal Article
• Authors: Perumalsamy, M.; Sudhahar, P. Arul Paul; John, J.; Vasanthi, R.
• Is Part Of: International journal of computational systems engineering. Volume 5:Issue 4(2019)
• Page Start: 230
• Page End: 234
• Publication Date: 2019-08-13
• Subjects: Steiner set -- edge fixed Steiner set -- Steiner number -- edge fixed Steiner number -- edge fixed edge Steiner set -- edge fixed edge Steiner number; Computer science -- Periodicals; Electronic data processing -- Periodicals; System analysis -- Periodicals; 003.3
• Languages: English
• ISSNs: 2046-3391

Abstract

For a non-empty set W of vertices in a connected graph G, the Steiner distance d ( W ) of W is the minimum size of a connected sub-graph of G containing W . S ( W ) denotes the set of vertices that lies in Steiner W-trees. Steiner set of a graph was introduced by Chartrand and Zhang (2002). An edge Steiner set of a graph was introduced by Santhakumaran and John (2007). In this paper, we introduce edge fixed edge Steiner set and study some of the characteristics of edge fixed edge Steiner number and provide the bounds for edge fixed edge Steiner number. Also we prove the existence theorem.