Steiner domination number of some wheel related graphs
Journal: International Journal of Mathematics and Soft Computing (Vol.5, No. 2)Publication Date: 2015.07.10
Authors : S K Vaidya; R N Mehta;
Page : 15-19
Keywords : Domination number; steiner number and steiner domination number;
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 subgraph G containing W. Necessarily, each such subgraph is a tree and is called a steiner tree or a steiner W - tree. The set of all vertices of G that lie on some steiner W - tree is denoted by S(W). If S(W) = V (G) then W is called a steiner set for G. The steiner number s(G) is the minimum cardinality of a steiner set. The minimum cardinality of a steiner dominating set is called the steiner domination number of graph.
Other Latest Articles
- The l1 - Convexity number of a graph
- Vertex covering transversal domination in graphs
- Uterine Sarcoma Morcellation, Impact on Survival
- Association of Maternal and Cord Blood IGF-I with Leptin Levels in Preeclampsia
- Temporal Relationship between Endometriosis and Overactive: A Nationwide Population-Based Cohort Study in Taiwan
Last modified: 2017-08-30 19:32:25