Edge fixed edge Steiner number of a graph
by M. Perumalsamy; P. Arul Paul Sudhahar; J. John; R. Vasanthi
International Journal of Computational Systems Engineering (IJCSYSE), Vol. 5, No. 4, 2019

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.

Online publication date: Thu, 22-Aug-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Systems Engineering (IJCSYSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com