Some Steiner concepts on lexicographic products of graphs

Abstract

The smallest tree that contains all vertices of a subset W of V (G) is called a Steiner tree. The number of edges of such a tree is the Steiner distance of W and union of all Steiner trees of W form a Steiner interval. Both of them are described for the lexicographic product in the present work. We also give a complete answer for the following invariants… (More)
DOI: 10.1142/S1793830914500608

Topics

Cite this paper

@article{Anand2014SomeSC, title={Some Steiner concepts on lexicographic products of graphs}, author={Bijo S. Anand and Manoj Changat and Iztok Peterin and Prasanth G. Narasimha-Shenoi}, journal={Discrete Math., Alg. and Appl.}, year={2014}, volume={6} }