Back to Search
Start Over
Some Steiner concepts on lexicographic products of graphs.
- Source :
-
Discrete Mathematics, Algorithms & Applications . Dec2014, Vol. 6 Issue 4, p-1. 14p. - Publication Year :
- 2014
-
Abstract
- Let G be a graph and W a subset of V(G). A subtree with the minimum number of edges that contains all vertices of W is a Steiner tree for W. The number of edges of such a tree is the Steiner distance of W and union of all vertices belonging to Steiner trees for W form a Steiner interval. We describe both of these for the lexicographic product of graphs. We also give a complete answer for the following invariants with respect to the Steiner convexity: the Steiner number, the rank, the hull number, and the Carathéodory number, and a partial answer for the Radon number. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 17938309
- Volume :
- 6
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics, Algorithms & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 98836591
- Full Text :
- https://doi.org/10.1142/S1793830914500608